5153 search results - page 811 / 1031 » Introduction to Randomized Algorithms |
141
Voted
DASFAA
2007
IEEE
15 years 9 months ago
2007
IEEE
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...
134
Voted
SWAT
2004
Springer
15 years 8 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
138
click to vote
SIGMOD
2010
ACM
15 years 8 months ago
2010
ACM
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
118
Voted
INFOCOM
2000
IEEE
15 years 7 months ago
2000
IEEE
— In broadcast disk systems, information is broadcasted in a shared medium. When a client needs an item from the disk, it waits until that item is broadcasted. The fundamental al...
153
Voted
ICCAD
1999
IEEE
15 years 7 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...