Sciweavers

75 search results - page 13 / 15
» Message passing algorithms and improved LP decoding
Sort
View
CVPR
2004
IEEE
14 years 9 months ago
Efficient Belief Propagation for Early Vision
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
Pedro F. Felzenszwalb, Daniel P. Huttenlocher
CVPR
2009
IEEE
15 years 2 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...
IPPS
2007
IEEE
14 years 1 months ago
Dynamic Load-Balancing and High Performance Communication in Jcluster
This paper describes the dynamic load-balancing and high performance communication provided in Jcluster, an efficient Java parallel environment. For the efficient loadbalancing,...
Bao-Yin Zhang, Zeyao Mo, Guangwen Yang, Weimin Zhe...
TSP
2010
13 years 2 months ago
Distributed estimation of channel gains in wireless sensor networks
We consider the problem of distributed channel estimation in a sensor network which employs a random sleep strategy to conserve energy. If the N network nodes are randomly placed a...
Sivagnanasundaram Ramanan, John MacLaren Walsh
ICASSP
2008
IEEE
14 years 2 months ago
Joint base-calling of two DNA sequences with factor graphs
—Automated estimation of DNA base-sequences is an important step in genomics and in many other emerging fields in biological and medical sciences. Current automated sequencers p...
Xiaomeng Shi, Desmond S. Lun, Jim Meldrim, Ralf K&...