Sciweavers

434 search results - page 33 / 87
» Constraint-Based Combinators for Local Search
Sort
View
TEC
2002
163views more  TEC 2002»
15 years 4 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
155
Voted
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
15 years 6 months ago
Adaptive local ratio
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 ...
Julián Mestre
134
Voted
SIGIR
2000
ACM
15 years 9 months ago
Topical locality in the Web
Most web pages are linked to others with related content. This idea, combined with another that says that text in, and possibly around, HTML anchors describe the pages to which th...
Brian D. Davison
168
Voted
DAGM
2010
Springer
15 years 5 months ago
An Improved Histogram of Edge Local Orientations for Sketch-Based Image Retrieval
Content-based image retrieval requires a natural image (e.g, a photo) as query, but the absence of such a query image is usually the reason for a search. An easy way to express the...
Jose M. Saavedra, Benjamin Bustos
CVPR
2009
IEEE
1289views Computer Vision» more  CVPR 2009»
17 years 9 days ago
Bundling Features for Large Scale Partial-Duplicate Web Image Search
In state-of-the-art image retrieval systems, an image is represented by a bag of visual words obtained by quantizing high-dimensional local image descriptors, and scalable schem...
Zhong Wu (Tsinghua University), Qifa Ke (Microsoft...