2393 search results - page 114 / 479 » Bounds-Consistent Local Search |
86
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
The landscape formalism unites a finite candidate solution set to a neighborhood topology and an objective function. This construct can be used to model the behavior of local sea...
123
Voted
CVPR
2009
IEEE
16 years 8 months ago
2009
IEEE
Object localization and classification are important problems in computer vision.
However, in many applications, exhaustive search over all class labels and image
locations is co...
89
Voted
IPTPS
2005
Springer
15 years 6 months ago
2005
Springer
Tulip is an overlay for routing, searching and publish-lookup information sharing. It offers a unique combination of the advantages of both structured and unstructured overlays, t...
105
click to vote
ICASSP
2008
IEEE
15 years 7 months ago
2008
IEEE
It is well known that high-dimensional nearest-neighbor retrieval is very expensive. Many signal processing methods suffer from this computing cost. Dramatic performance gains can...
114
Voted
IJCAI
2003
15 years 2 months ago
2003
The weighted CSP (WCSP) framework is a soft constraint framework with a wide range of applications. In this paper, we consider the problem of maintaining local consistency during ...