Sciweavers

1407 search results - page 92 / 282
» Join-Graph Propagation Algorithms
Sort
View
JAIR
2006
143views more  JAIR 2006»
13 years 8 months ago
Convexity Arguments for Efficient Minimization of the Bethe and Kikuchi Free Energies
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms have been...
Tom Heskes
ICIP
2006
IEEE
14 years 10 months ago
Dead-End Elimination as a Heuristic for Min-Cut Image Segmentation
We apply the dead-end elimination (DEE) strategy from protein design as a heuristic for the max-flow/min-cut formulation of the image segmentation problem. DEE combines aspects of...
Mala L. Radhakrishnan, Sara L. Su
POPL
2007
ACM
14 years 9 months ago
A proposal for parallel self-adjusting computation
We present an overview of our ongoing work on parallelizing self-adjusting-computation techniques. In self-adjusting computation, programs can respond to changes to their data (e....
Matthew Hammer, Umut A. Acar, Mohan Rajagopalan, A...
VTC
2008
IEEE
14 years 3 months ago
High Data Rate WLAN
—This paper considers the problem of providing gbps/user data-rate in indoor environments. The technology that we study uses the 60GHz spectrum whose special propagation properti...
Candy Yiu, Suresh Singh
CP
2005
Springer
14 years 2 months ago
Approximations in Distributed Optimization
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
Adrian Petcu, Boi Faltings