Sciweavers

15073 search results - page 118 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
158
Voted
ICCV
2009
IEEE
16 years 8 months ago
A Probabilistic Framework for Partial Intrinsic Symmetries in Geometric Data
In this paper, we present a novel algorithm for partial intrinsic symmetry detection in 3D geometry. Unlike previous work, our algorithm is based on a conceptually simple and st...
Ruxandra Lasowski, Art Tevs, Hans-Peter Seidel, Mi...
TNN
2010
148views Management» more  TNN 2010»
14 years 10 months ago
A fast algorithm for robust mixtures in the presence of measurement errors
Abstract--In experimental and observational sciences, detecting atypical, peculiar data from large sets of measurements has the potential of highlighting candidates of interesting ...
Jianyong Sun, Ata Kabán
143
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
Range counting over multidimensional data streams
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
Subhash Suri, Csaba D. Tóth, Yunhong Zhou
107
Voted
SIGMOD
1998
ACM
96views Database» more  SIGMOD 1998»
15 years 7 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....
CPE
1998
Springer
80views Hardware» more  CPE 1998»
15 years 7 months ago
Probability, Parallelism and the State Space Exploration Problem
We present a new dynamic probabilistic state exploration algorithm based on hash compaction. Our method has a low state omission probability and low memory usage that is independen...
William J. Knottenbelt, Mark Mestern, Peter G. Har...