Sciweavers

5138 search results - page 513 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
COLT
1998
Springer
15 years 11 months ago
Learning One-Variable Pattern Languages in Linear Average Time
A new algorithm for learning one-variable pattern languages is proposed and analyzed with respect to its average-case behavior. We consider the total learning time that takes into...
Rüdiger Reischuk, Thomas Zeugmann
SIGMOD
1998
ACM
96views Database» more  SIGMOD 1998»
15 years 11 months ago
Approximate Medians and other Quantiles in One Pass and with Limited Memory
We present new algorithms for computing approximate quantiles of large datasets in a single pass. The approximation guarantees are explicit, and apply without regard to the value ...
Gurmeet Singh Manku, Sridhar Rajagopalan, Bruce G....
VLDB
1994
ACM
140views Database» more  VLDB 1994»
15 years 11 months ago
Efficient and Effective Clustering Methods for Spatial Data Mining
Spatial data mining is the discovery of interesting relationships and characteristics that may exist implicitly in spatial databases. In this paper, we explore whether clustering ...
Raymond T. Ng, Jiawei Han
ASPDAC
2007
ACM
82views Hardware» more  ASPDAC 2007»
15 years 11 months ago
Fast Buffer Insertion for Yield Optimization Under Process Variations
With the emerging process variations in fabrication, the traditional corner-based timing optimization techniques become prohibitive. Buffer insertion is a very useful technique fo...
Ruiming Chen, Hai Zhou
ESA
2006
Springer
139views Algorithms» more  ESA 2006»
15 years 10 months ago
Stochastic Shortest Paths Via Quasi-convex Maximization
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
Evdokia Nikolova, Jonathan A. Kelner, Matthew Bran...