Sciweavers

545 search results - page 99 / 109
» Estimating the Probability of Approximate Matches
Sort
View
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
14 years 5 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
14 years 4 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
CVPR
1999
IEEE
15 years 26 days ago
Bayesian Multi-Camera Surveillance
The task of multi-camera surveillance is to reconstruct the paths taken by all moving objects that are temporarily visible from multiple non-overlapping cameras. We present a Baye...
Vera Kettnaker, Ramin Zabih
CVPR
2004
IEEE
15 years 26 days ago
Bayesian Assembly of 3D Axially Symmetric Shapes from Fragments
We present a complete system for the purpose of automatically assembling 3D pots given 3D measurements of their fragments commonly called sherds. A Bayesian approach is formulated...
Andrew R. Willis, David B. Cooper
ALT
2003
Springer
14 years 7 months ago
On the Existence and Convergence of Computable Universal Priors
Solomonoff unified Occam’s razor and Epicurus’ principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field...
Marcus Hutter