958 search results - page 69 / 192 » Efficient data structures for range-aggregate queries on tre... |
141
Voted
JIIS
2000
15 years 3 months ago
2000
Abstract. Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on effi...
101
Voted
EDBT
2008
ACM
16 years 3 months ago
2008
ACM
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
127
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
135
Voted
CONPAR
1992
15 years 7 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
138
Voted
AAAI
1990
15 years 4 months ago
1990
The Symbolic Probabilistic Inference (SPI) Algorithm [D'Ambrosio, 19891 provides an efficient framework for resolving general queries on a belief network. It applies the conc...