1046 search results - page 82 / 210 » Approximation Algorithms for Domination Search |
109
click to vote
SIGIR
2008
ACM
15 years 13 days ago
2008
ACM
Searching for people on the Web is one of the most common query types to the web search engines today. However, when a person name is queried, the returned webpages often contain ...
138
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
128
Voted
SAT
2010
Springer
14 years 11 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
204
click to vote
SIGMOD
2008
ACM
16 years 20 days ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
118
click to vote
ICALP
2004
Springer
15 years 6 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...