6365 search results - page 142 / 1273 » Fast Local Computation Algorithms |
146
click to vote
IPPS
2006
IEEE
15 years 11 months ago
2006
IEEE
In this work we present a system for implementing the placement and routing stages in the FPGA cycle of design, into the physical design stage. We start with the ISCAS benchmarks,...
169
click to vote
ECCV
2004
Springer
15 years 8 months ago
2004
Springer
A novel method allowing simplified and efficient active surface initialization for 3D images segmentation is presented. Our method allows to initialize an active surface through si...
163
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
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...
165
click to vote
DCOSS
2011
Springer
14 years 4 months ago
2011
Springer
—In many application scenarios sensors need to calculate the average of some local values, e.g. of local measurements. A possible solution is to rely on consensus algorithms. In ...
215
click to vote
PODC
2011
ACM
14 years 7 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...