Sciweavers

128 search results - page 8 / 26
» Increasingly correct message passing averaging algorithms
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
A general Bayesian algorithm for visual object tracking based on sparse features
This paper describes a Bayesian algorithm for rigid/non-rigid 2D visual object tracking based on sparse image features. The algorithm is inspired by the way human visual cortex se...
Mauricio Soto Alvarez, Carlo S. Regazzoni
ECCV
2006
Springer
14 years 9 months ago
Comparison of Energy Minimization Algorithms for Highly Connected Graphs
Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-...
Vladimir Kolmogorov, Carsten Rother
PAAPP
2006
44views more  PAAPP 2006»
13 years 7 months ago
Revisiting communication code generation algorithms for message-passing systems
In this paper, we investigate algorithms for generating communication code to run on distributedmemory systems. We modify algorithms from previously published work and prove that ...
Clayton S. Ferner
INFOCOM
1997
IEEE
13 years 11 months ago
A Distributed Algorithm for Delay-Constrained Unicast Routing
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...
Hussein F. Salama, Douglas S. Reeves, Yannis Vinio...
IPPS
1998
IEEE
13 years 11 months ago
Prioritized Token-Based Mutual Exclusion for Distributed Systems
A number of solutions have been proposed for the problem of mutual exclusion in distributed systems. Some of these approaches have since been extended to a prioritized environment...
Frank Mueller