Sciweavers

598 search results - page 83 / 120
» A random graph model for massive graphs
Sort
View
67
Voted
TSP
2008
103views more  TSP 2008»
14 years 11 months ago
Low-Rank Variance Approximation in GMRF Models: Single and Multiscale Approaches
Abstract--We present a versatile framework for tractable computation of approximate variances in large-scale Gaussian Markov random field estimation problems. In addition to its ef...
Dmitry M. Malioutov, Jason K. Johnson, Myung Jin C...
SMA
2005
ACM
109views Solid Modeling» more  SMA 2005»
15 years 5 months ago
Numerical decomposition of geometric constraints
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
Sebti Foufou, Dominique Michelucci, Jean-Paul Jurz...
WWW
2002
ACM
16 years 17 days ago
The structure of broad topics on the web
The Web graph is a giant social network whose properties have been measured and modeled extensively in recent years. Most such studies concentrate on the graph structure alone, an...
Soumen Chakrabarti, Mukul Joshi, Kunal Punera, Dav...
ICASSP
2011
IEEE
14 years 3 months ago
Reaching consensus in asynchronous WSNs: Algebraic approach
Many models of wireless sensor networks (WSNs) assume a perfect synchronization along the graph of such network as a simplifying assumption. In our contribution we base our invest...
Ondrej Sluciak, Markus Rupp
CVPR
2008
IEEE
16 years 1 months ago
Learning for stereo vision using the structured support vector machine
We present a random field based model for stereo vision with explicit occlusion labeling in a probabilistic framework. The model employs non-parametric cost functions that can be ...
Yunpeng Li, Daniel P. Huttenlocher