2393 search results - page 116 / 479 » Bounds-Consistent Local Search |
123
click to vote
DAM
2000
15 years 18 days ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
83
Voted
IDEAL
2009
Springer
14 years 10 months ago
2009
Springer
Many classification algorithms use the concept of distance or similarity between patterns. Previous work has shown that it is advantageous to optimize general Euclidean distances (...
111
Voted
INFOSCALE
2007
ACM
15 years 2 months ago
2007
ACM
Searching for non-text data (e.g., images) is mostly done by means of metadata annotations or by extracting the text close to the data. However, supporting real content-based audi...
101
Voted
MM
2004
ACM
15 years 6 months ago
2004
ACM
It is important and challenging to make the growing image repositories easy to search and browse. Image clustering is a technique that helps in several ways, including image data ...
123
click to vote
AIMSA
2008
Springer
15 years 2 months ago
2008
Springer
We present a hybrid approach to Distributed Constraint Satisfaction which combines incomplete, fast, penalty-based local search with complete, slower systematic search. Thus, we pr...