Sciweavers

1632 search results - page 22 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
DEXAW
2008
IEEE
120views Database» more  DEXAW 2008»
15 years 9 months ago
Self-Similarity Metric for Index Pruning in Conceptual Vector Space Models
— One of the critical issues in search engines is the size of search indexes: as the number of documents handled by an engine increases, the search must preserve its efficiency,...
Dario Bonino, Fulvio Corno
SISAP
2009
IEEE
155views Data Mining» more  SISAP 2009»
15 years 10 months ago
Analyzing Metric Space Indexes: What For?
—It has been a long way since the beginnings of metric space searching, where people coming from algorithmics tried to apply their background to this new paradigm, obtaining vari...
Gonzalo Navarro
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 8 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
ALGORITHMICA
2011
14 years 10 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
16 years 20 days ago
A Fourier space algorithm for solving quadratic assignment problems
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
Risi Kondor