3223 search results - page 183 / 645 » The Scaling of Search Cost |
173
click to vote
ICCS
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...
171
click to vote
IPPS
2006
IEEE
16 years 16 days ago
2006
IEEE
In this work we present a system for implementing the placement and routing stages in the FPGA cycle of design, into the physical design stage. We start with the ISCAS benchmarks,...
163
click to vote
SIGIR
2004
ACM
15 years 12 months ago
2004
ACM
: We consider the problem of collaborative Web search and query routing strategies in a peer-to-peer (P2P) environment. In our architecture every peer has a full-fledged search en...
152
click to vote
ICGI
2004
Springer
15 years 12 months ago
2004
Springer
State Merging algorithms, such as Rodney Price’s EDSM (Evidence-Driven State Merging) algorithm, have been reasonably successful at solving DFA-learning problems. EDSM, however, ...
169
click to vote
SETN
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables ar...