Sciweavers

4047 search results - page 238 / 810
» The Discrete Basis Problem
Sort
View
COMPGEOM
2009
ACM
15 years 11 months ago
Randomly removing g handles at once
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
Glencora Borradaile, James R. Lee, Anastasios Sidi...
ICPR
2008
IEEE
15 years 11 months ago
Structure from Motion: Combining features correspondences and optical flow
This paper suggests using discrete feature displacements and optical flow simultaneously to determine the camera motion and its velocity. This is advantageous when the number of ...
Adel H. Fakih, John Zelek
CAAN
2007
Springer
15 years 10 months ago
Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm
In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a d...
Margaret-Ellen Messinger, Pawel Pralat, Richard J....
COLT
2007
Springer
15 years 10 months ago
Sketching Information Divergences
When comparing discrete probability distributions, natural measures of similarity are not p distances but rather are informationdivergences such as Kullback-Leibler and Hellinger. ...
Sudipto Guha, Piotr Indyk, Andrew McGregor
ISICA
2007
Springer
15 years 10 months ago
Parameter Setting for Evolutionary Latent Class Clustering
The latent class model or multivariate multinomial mixture is a powerful model for clustering discrete data. This model is expected to be useful to represent non-homogeneous popula...
Damien Tessier, Marc Schoenauer, Christophe Bierna...