Sciweavers

565 search results - page 104 / 113
» Geometry of Upper Probabilities
Sort
View
STOC
2002
ACM
144views Algorithms» more  STOC 2002»
14 years 10 months ago
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
Surender Baswana, Ramesh Hariharan, Sandeep Sen
CVPR
2004
IEEE
14 years 12 months 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
ECCV
2006
Springer
14 years 11 months ago
Segmentation of High Angular Resolution Diffusion MRI Modeled as a Field of von Mises-Fisher Mixtures
High angular resolution diffusion imaging (HARDI) permits the computation of water molecule displacement probabilities over a sphere of possible displacement directions. This proba...
Tim McGraw, Baba C. Vemuri, Robert Yezierski, Thom...
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 10 months ago
Polynomial Learning of Distribution Families
Abstract--The question of polynomial learnability of probability distributions, particularly Gaussian mixture distributions, has recently received significant attention in theoreti...
Mikhail Belkin, Kaushik Sinha
ECCV
2002
Springer
14 years 11 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel