Sciweavers

3341 search results - page 295 / 669
» On Bounded Queries and Approximation
Sort
View
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
16 years 4 days ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
SMA
2003
ACM
123views Solid Modeling» more  SMA 2003»
15 years 12 months ago
Collision prediction for polyhedra under screw motions
The prediction of collisions amongst N rigid objects may be reduced to a series of computations of the time to first contact for all pairs of objects. Simple enclosing bounds and...
ByungMoon Kim, Jarek Rossignac
164
Voted
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
16 years 7 months ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han
284
Voted
VLDB
2003
ACM
147views Database» more  VLDB 2003»
16 years 7 months ago
RE-tree: an efficient index structure for regular expressions
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...
Chee Yong Chan, Minos N. Garofalakis, Rajeev Rasto...
VLDB
2004
ACM
180views Database» more  VLDB 2004»
16 years 2 days ago
Bloom Histogram: Path Selectivity Estimation for XML Data with Updates
Cost-based XML query optimization calls for accurate estimation of the selectivity of path expressions. Some other interactive and internet applications can also benefit from suc...
Wei Wang 0011, Haifeng Jiang, Hongjun Lu, Jeffrey ...