958 search results - page 68 / 192 » Efficient data structures for range-aggregate queries on tre... |
116
click to vote
MOBIDE
2005
ACM
15 years 6 months ago
2005
ACM
Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index ...
104
Voted
UAI
2008
15 years 2 months ago
2008
A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown p...
151
Voted
SSDBM
2002
IEEE
15 years 5 months ago
2002
IEEE
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
198
Voted
SIGMOD
2008
ACM
16 years 22 days ago
2008
ACM
Text documents often embed data that is structured in nature. This structured data is increasingly exposed using information extraction systems, which generate structured relation...
AEI
1999
15 years 7 days ago
1999
Many computer simulations, experimental testing and monitoring of physical systems produce vast amounts of quantitative data. These data have always been assimilated by trained an...