Sciweavers

882 search results - page 86 / 177
» Local Search for Very Large SAT Problems
Sort
View
VLDB
1999
ACM
118views Database» more  VLDB 1999»
15 years 8 months ago
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
Aristides Gionis, Piotr Indyk, Rajeev Motwani
WEBDB
2007
Springer
128views Database» more  WEBDB 2007»
15 years 10 months ago
Supporting Range Queries on Web Data Using k-Nearest Neighbor Search
A large volume of geospatial data is available on the web through various forms of applications. However, access to these data is limited by certain types of queries due to restric...
Wan D. Bae, Shayma Alkobaisi, Seon Ho Kim, Sada Na...
156
Voted
WWW
2010
ACM
15 years 11 months ago
A pattern tree-based approach to learning URL normalization rules
Duplicate URLs have brought serious troubles to the whole pipeline of a search engine, from crawling, indexing, to result serving. URL normalization is to transform duplicate URLs...
Tao Lei, Rui Cai, Jiang-Ming Yang, Yan Ke, Xiaodon...
ECCV
2002
Springer
16 years 6 months ago
Building Roadmaps of Local Minima of Visual Models
Getting trapped in suboptimal local minima is a perennial problem in model based vision, especially in applications like monocular human body tracking where complex nonlinear para...
Cristian Sminchisescu, Bill Triggs
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 7 months ago
How an optimal observer can collapse the search space
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
Christophe Philemotte, Hugues Bersini