Sciweavers

4926 search results - page 534 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
EMMCVPR
2003
Springer
15 years 8 months ago
Asymptotic Characterization of Log-Likelihood Maximization Based Algorithms and Applications
The asymptotic distribution of estimates that are based on a sub-optimal search for the maximum of the log-likelihood function is considered. In particular, estimation schemes that...
Doron Blatt, Alfred O. Hero
PAMI
2010
215views more  PAMI 2010»
15 years 1 months ago
Fusion Moves for Markov Random Field Optimization
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
Victor S. Lempitsky, Carsten Rother, Stefan Roth, ...
GRAPHICSINTERFACE
2007
15 years 4 months ago
Robust pixel classification for 3D modeling with structured light
Modeling 3D objects and scenes is an important part of computer graphics. One approach to modeling is projecting binary patterns onto the scene in order to obtain correspondences ...
Yi Xu, Daniel G. Aliaga
JCB
2007
168views more  JCB 2007»
15 years 3 months ago
Fast Molecular Shape Matching Using Contact Maps
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
Pankaj K. Agarwal, Nabil H. Mustafa, Yusu Wang
INFOCOM
2005
IEEE
15 years 9 months ago
Perfect simulation and stationarity of a class of mobility models
— We define “random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random wa...
Jean-Yves Le Boudec, Milan Vojnovic