Sciweavers

203 search results - page 18 / 41
» Random walks on graphs to model saliency in images
Sort
View
88
Voted
TSP
2008
100views more  TSP 2008»
15 years 8 days ago
Geographic Gossip: Efficient Averaging for Sensor Networks
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....
96
Voted
ICIP
2010
IEEE
14 years 10 months ago
View synthesis based on Conditional Random Fields and graph cuts
We propose a novel method to synthesize intermediate views from two stereo images and disparity maps that is robust to errors in disparity map. The proposed method computes a plac...
Lam C. Tran, Christopher J. Pal, Truong Q. Nguyen
INFOCOM
2006
IEEE
15 years 6 months ago
Wealth-Based Evolution Model for the Internet AS-Level Topology
— In this paper, we seek to understand the intrinsic reasons for the well-known phenomenon of heavy-tailed degree in the Internet AS graph and argue that in contrast to tradition...
Xiaoming Wang, Dmitri Loguinov
TON
2010
83views more  TON 2010»
14 years 10 months ago
Understanding and modeling the internet topology: economics and evolution perspective
Abstract—In this paper, we seek to understand the intrinsic reasons for the well-known phenomenon of heavy-tailed degree in the Internet AS graph and argue that in contrast to tr...
Xiaoming Wang, Dmitri Loguinov
107
Voted
FGR
2008
IEEE
346views Biometrics» more  FGR 2008»
15 years 6 months ago
Markov random field models for hair and face segmentation
This paper presents an algorithm for measuring hair and face appearance in 2D images. Our approach starts by using learned mixture models of color and location information to sugg...
Kuang-chih Lee, Dragomir Anguelov, Baris Sumengen,...