Sciweavers

220 search results - page 13 / 44
» A Dynamic Pivot Selection Technique for Similarity Search
Sort
View
AAAI
2007
13 years 9 months ago
Transposition Tables for Constraint Satisfaction
In this paper, a state-based approach for the Constraint Satisfaction Problem (CSP) is proposed. The key novelty is an original use of state memorization during search to prevent ...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
INFOCOM
2010
IEEE
13 years 5 months ago
Surfing the Blogosphere: Optimal Personalized Strategies for Searching the Web
We propose a distributed mechanism for finding websurfing strategies that is inspired by the StumbleUpon recommendation engine. Each day, a websurfer visits a sequence of websites ...
Stratis Ioannidis, Laurent Massoulié
CP
1998
Springer
13 years 11 months ago
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
Paul Shaw
ICPR
2006
IEEE
14 years 8 months ago
Feature selection based on the training set manipulation
A novel filter feature selection technique is introduced. The method exploits the information conveyed by the evolution of the training samples weights similarly to the Adaboost a...
Pavel Krízek, Josef Kittler, Václav ...
ICDE
1998
IEEE
163views Database» more  ICDE 1998»
14 years 8 months ago
Fast Nearest Neighbor Search in High-Dimensional Space
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, H...