958 search results - page 63 / 192 » Efficient data structures for range-aggregate queries on tre... |
125
click to vote
EDBT
2010
ACM
15 years 3 months ago
2010
ACM
A key advantage of scientific workflow systems over traditional scripting approaches is their ability to automatically record data and process dependencies introduced during workf...
106
Voted
TMC
2008
15 years 14 days ago
2008
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Moreo...
UAI
1996
15 years 1 months ago
1996
The main goal of this paper is to describe a data structure called binary join trees that are useful in computing multiple marginals efficiently using the Shenoy-Shafer architectu...
86
Voted
SIGMOD
2003
ACM
16 years 21 days ago
2003
ACM
XML databases often contain documents comprising structured text. Therefore, it is important to integrate "information retrieval style" query evaluation, which is well-s...
114
click to vote
ICCV
2007
IEEE
16 years 2 months ago
2007
IEEE
Models of activity structure for unconstrained environments are generally not available a priori. Recent representational approaches to this end are limited by their computational...