2694 search results - page 486 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
105
click to vote
CIMAGING
2009
14 years 10 months ago
2009
We present a new method for multi-object segmentation in a maximum a posteriori estimation framework. Our method is motivated by the observation that neighboring or coupling objec...
ENTCS
2007
14 years 9 months ago
2007
Soft constraints extend classical constraints to deal with non-functional requirements, overconstrained problems and preferences. Bistarelli, Montanari and Rossi have developed a ...
115
click to vote
FPGA
2010
ACM
14 years 10 months ago
2010
ACM
We use reconfigurable hardware to construct a high throughput Bayesian computing machine (BCM) capable of evaluating probabilistic networks with arbitrary DAG (directed acyclic gr...
111
click to vote
PODC
2011
ACM
14 years 17 days ago
2011
ACM
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...