4 citations · 5 across the 5 of their papers we have counts for
Showing 2026 · cs.DCShow all
2 papers · 2 filters
cs.DC2026
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…
cs.DC2026
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…