2694 search results - page 486 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
150
click to vote
CIMAGING
2009
15 years 3 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...
122
click to vote
ENTCS
2007
15 years 2 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 ...
164
click to vote
FPGA
2010
ACM
15 years 2 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...
150
click to vote
PODC
2011
ACM
14 years 5 months 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...
101
click to vote
CP
2005
Springer
15 years 8 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 ...