806 search results - page 108 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
VLDB
2004
ACM
14 years 8 months ago
2004
ACM
Indatawarehousingapplications,numerousOLAP queries involve the processing of holistic aggregators such as computing the "top n," median, quantiles, etc. In this paper, we...
CHI
1993
ACM
13 years 12 months ago
1993
ACM
Modern computer users must often sift and manage vast amounts of hierarchically structured information. However, conventional interface tools have not kept pace with the informati...
ESA
2004
Springer
14 years 1 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
ICDE
2002
IEEE
14 years 20 days ago
2002
IEEE
Soon, much of the data exchanged over the Internet will be encoded in XML, allowing for sophisticated filtering and content-based routing. We have built a filtering engine called ...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
Scientific workflow systems are increasingly used to automate complex data analyses, largely due to their benefits over traditional approaches for workflow design, optimization, a...