4 citations · 5 across the 5 of their papers we have counts for
5 papers · 1 filter
A Configurable Heuristic for the MLCS Problem
Farhana Akter Tumpa, Rebin Silva Valan Arasu, Rajiv Gupta
Motivation: The Multiple Longest Common Subsequence (MLCS) problem for an arbitrary number of sequences is an NP-hard problem in sequence analysis. Existing exact algorithms based…
BOA: Beamwidth Online Adaptation for Filtered-ANNS on a GPU
Farhana Akter Tumpa, Rajiv Gupta
Filtered approximate nearest neighbor search, i.e. returning the top-k vectors nearest to a query vector among those satisfying one or more attribute predicates, has become a funda…
Solving Subgraph Extraction Problems Using Search
Rebin Silva Valan Arasu, Rajiv Gupta
Many NP-hard graph problems can be modeled as optimal subgraph extraction problems with feasibility constraints. From Network Design to Facility Location, from Robotics to Graph Dr…
AI-PROPELLER: Warehouse-Scale Interprocedural Code Layout Optimization with AlphaEvolve
Chaitanya Mamatha Ananda, Rajiv Gupta, Mircea Trofin +4
Post-link optimizers (PLOs) such as Propeller and BOLT have demonstrated that precise, profile-guided code layout can extract significant performance gains from heavily optimized b…
SemLoc: Structured Grounding of Free-Form LLM Reasoning for Fault Localization
Zhaorui Yang, Haichao Zhu, Qian Zhang +2
Large language models (LLMs) can describe what a piece of code should compute, but they do so in free-form text. Such text cannot be checked against program executions, and it does…