Sciweavers

3211 search results - page 345 / 643
» On the Grundy Number of a Graph
Sort
View
PAMI
2006
156views more  PAMI 2006»
15 years 6 months ago
Robust Point Matching for Nonrigid Shapes by Preserving Local Neighborhood Structures
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
Yefeng Zheng, David S. Doermann
TIT
2008
127views more  TIT 2008»
15 years 6 months ago
Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality
Abstract--Max-product "belief propagation" (BP) is an iterative, message-passing algorithm for finding the maximum a posteriori (MAP) assignment of a discrete probability...
Mohsen Bayati, Devavrat Shah, Mayank Sharma
CSL
2004
Springer
15 years 6 months ago
HyperLex: lexical cartography for information retrieval
This article describes an algorithm called HyperLex that is capable of automatically determining word uses in a textbase without recourse to a dictionary. The algorithm makes use ...
Jean Véronis
209
Voted
IJON
2010
189views more  IJON 2010»
15 years 5 months ago
Inference and parameter estimation on hierarchical belief networks for image segmentation
We introduce a new causal hierarchical belief network for image segmentation. Contrary to classical tree structured (or pyramidal) models, the factor graph of the network contains...
Christian Wolf, Gérald Gavin
MICS
2010
134views more  MICS 2010»
15 years 5 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara