Sciweavers

2079 search results - page 212 / 416
» Universality of random graphs
Sort
View
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
15 years 8 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
CVIU
2007
113views more  CVIU 2007»
15 years 6 months ago
Primal sketch: Integrating structure and texture
This article proposes a generative image model, which is called ‘‘primal sketch,’’ following Marr’s insight and terminology. This model combines two prominent classes of...
Cheng-en Guo, Song Chun Zhu, Ying Nian Wu
CVPR
2009
IEEE
1695views Computer Vision» more  CVPR 2009»
17 years 1 months ago
Geometric min-Hashing: Finding a (Thick) Needle in a Haystack
We propose a novel hashing scheme for image retrieval, clustering and automatic object discovery. Unlike commonly used bag-of-words approaches, the spatial extent of image featu...
Ondrej Chum (Czech Technical University), Michal P...
CVPR
2009
IEEE
17 years 1 months ago
Alphabet SOUP: A Framework for Approximate Energy Minimization
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...
CVPR
2009
IEEE
17 years 1 months ago
Isometric Registration of Ambiguous and Partial Data
This paper introduces a new shape matching algorithm for computing correspondences between 3D surfaces that have undergone (approximately) isometric deformations. The new approach ...
Art Tevs (Max Planck Institute Informatik), Martin...