2880 search results - page 256 / 576 » Approximate Range Searching |
113
Voted
SIGMOD
2001
ACM
16 years 4 months ago
2001
ACM
This paper proposes and evaluates Prefetching B+ -Trees pB+ -Trees, which use prefetching to accelerate two important operations on B+ -Tree indices: searches and range scans. To ...
122
click to vote
EDBT
2004
ACM
16 years 4 months ago
2004
ACM
Abstract. Non-contiguous subsequence pattern queries search for symbol instances in a long sequence that satisfy some soft temporal constraints. In this paper, we propose a methodo...
119
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
— This paper investigates the implementation of a number of circuits used to perform a high speed closest value match lookup. The design is targeted particularly for use in a sea...
147
click to vote
BERTINORO
2005
Springer
15 years 9 months ago
2005
Springer
In this paper we present and evaluate uncoordinated on-line algorithms for simultaneous storage and replication load-balancing in DHT-based peer-to-peer systems. We compare our ap...