Sciweavers

50 search results - page 10 / 10
» Exact Sampling and Approximate Counting Techniques
Sort
View
CAD
2005
Springer
13 years 5 months ago
Optimizing the topological and combinatorial complexity of isosurfaces
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
Carlos Andújar, Pere Brunet, Antoni Chica, ...
AAAI
2007
13 years 7 months ago
Combining Multiple Heuristics Online
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
SIGMOD
1998
ACM
96views Database» more  SIGMOD 1998»
13 years 9 months ago
Wavelet-Based Histograms for Selectivity Estimation
Query optimization is an integral part of relational database management systems. One important task in query optimization is selectivity estimation, that is, given a query P, we ...
Yossi Matias, Jeffrey Scott Vitter, Min Wang
VLSID
2006
IEEE
129views VLSI» more  VLSID 2006»
14 years 5 months ago
A Stimulus-Free Probabilistic Model for Single-Event-Upset Sensitivity
With device size shrinking and fast rising frequency ranges, effect of cosmic radiations and alpha particles known as Single-Event-Upset (SEU), Single-Eventtransients (SET), is a ...
Mohammad Gh. Mohammad, Laila Terkawi, Muna Albasma...
APPROX
2011
Springer
197views Algorithms» more  APPROX 2011»
12 years 5 months ago
Periodicity and Cyclic Shifts via Linear Sketches
We consider the problem of identifying periodic trends in data streams. We say a signal a ∈ Rn is p-periodic if ai = ai+p for all i ∈ [n − p]. Recently, Erg¨un et al. [4] pr...
Michael S. Crouch, Andrew McGregor