217 search results - page 22 / 44 » On the Fine Structure of Large Search Spaces |
157
click to vote
SPIN
2009
Springer
16 years 18 days ago
2009
Springer
Existing techniques for approximate storage of visited states in a model checker are too special-purpose and too DRAM-intensive. Bitstate hashing, based on Bloom filters, is good ...
163
click to vote
IAT
2007
IEEE
16 years 12 days ago
2007
IEEE
We present a new hybrid algorithm for local search in distributed combinatorial optimization. This method is a mix between classical local search methods in which nodes take decis...
177
Voted
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
153
click to vote
ICPR
2000
IEEE
16 years 7 months ago
2000
IEEE
This paper presents an algorithm, called the winnerupdate algorithm, for accelerating the nearest neighbor search. By constructing a hierarchical structure ,for each feature point...
178
click to vote
ESWS
2008
Springer
15 years 7 months ago
2008
Springer
The increasing amount of data on the Semantic Web offers opportunities for semantic search. However, formal query hinders the casual users in expressing their information need as t...