16 search results - page 4 / 4 » The Complexity of Interval Routing on Random Graphs |
SISAP
2009
IEEE
14 years 10 days ago
2009
IEEE
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...