1284 search results - page 152 / 257 » Data Structures for Mergeable Trees |
108
click to vote
VLDB
2005
ACM
15 years 8 months ago
2005
ACM
With the increasing occurrence of temporal and spatial data in present-day database applications, the interval data type is adopted by more and more database systems. For an effic...
240
Voted
ICDE
2004
IEEE
16 years 3 months ago
2004
IEEE
The effectiveness of many existing high-dimensional indexing structures is limited to specific types of queries and workloads. For example, while the Pyramid technique and the iMi...
121
Voted
IPSN
2009
Springer
15 years 9 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
115
click to vote
DATESO
2004
15 years 3 months ago
2004
Large sparse matrices play important role in many modern information retrieval methods. These methods, such as clustering, latent semantic indexing, performs huge number of computa...
111
click to vote
ISMB
1998
15 years 3 months ago
1998
This workfocuses on the inference of evolutionary relationships in protein superfamilies, and the uses of these relationships to identify keypositions in the structure, to infer a...