97 search results - page 15 / 20 » Simple optimization techniques for A*-based search |
252
Voted
SIGIR
2011
ACM
14 years 6 months ago
2011
ACM
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
121
Voted
KDD
1994
ACM
15 years 7 months ago
1994
ACM
Oneof the mainobstacles in applying data mining techniques to large, real-world databasesis the lack of efficient data management.In this paper, wepresent the design and implement...
135
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
148
Voted
PAMI
2006
15 years 3 months ago
2006
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
134
click to vote
SIGMOD
2000
ACM
15 years 7 months ago
2000
ACM
We present WSQ/DSQ (pronounced “wisk-disk”), a new approach for combining the query facilities of traditional databases with existing search engines on the Web. WSQ, for Web-S...