Sciweavers

5580 search results - page 896 / 1116
» Randomized priority algorithms
Sort
View
DASFAA
2007
IEEE
221views Database» more  DASFAA 2007»
15 years 8 months ago
TwigList : Make Twig Pattern Matching Fast
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...
Lu Qin, Jeffrey Xu Yu, Bolin Ding
126
Voted
SIGMOD
2010
ACM
173views Database» more  SIGMOD 2010»
15 years 7 months ago
PR-join: a non-blocking join achieving higher early result rate with statistical guarantees
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...
Shimin Chen, Phillip B. Gibbons, Suman Nath
INFOCOM
2000
IEEE
15 years 6 months ago
Broadcast Disks with Polynomial Cost Functions
— 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...
Amotz Bar-Noy, Boaz Patt-Shamir, Igor Ziper
ICCAD
1999
IEEE
181views Hardware» more  ICCAD 1999»
15 years 6 months ago
A new heuristic for rectilinear Steiner trees
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 ...
Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganle...
STOC
1993
ACM
117views Algorithms» more  STOC 1993»
15 years 6 months ago
Efficient noise-tolerant learning from statistical queries
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
Michael J. Kearns