Sciweavers

1914 search results - page 137 / 383
» Evaluation of a Catalytic Search Algorithm
Sort
View
PROCEDIA
2011
14 years 25 days ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff
TIP
2010
88views more  TIP 2010»
14 years 4 months ago
Efficient Stereoscopic Ranging via Stochastic Sampling of Match Quality
We present an efficient method that computes dense stereo correspondences by stochastically sampling match quality values. Nonexhaustive sampling facilitates the use of quality met...
Thayne Richard Coffman, Alan Conrad Bovik
WWW
2009
ACM
15 years 10 months ago
Unsupervised query categorization using automatically-built concept graphs
Automatic categorization of user queries is an important component of general purpose (Web) search engines, particularly for triggering rich, query-specific content and sponsored ...
Eustache Diemert, Gilles Vandelle
WWW
2005
ACM
15 years 10 months ago
Sampling search-engine results
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...
CVPR
2010
IEEE
15 years 7 months ago
Aggregating local descriptors into a compact image representation
We address the problem of image search on a very large scale, where three constraints have to be considered jointly: the accuracy of the search, its efficiency, and the memory usag...
Hervé Jégou, Matthijs Douze, Cordelia Schmid and...