724 search results - page 16 / 145 » Practical Performance of Efficient Minimum Cut Algorithms |
DAC
2006
ACM
16 years 20 days ago
2006
ACM
In this paper we present a new efficient algorithm for retiming sequential circuits with edge-triggered registers under both setup and hold constraints. Compared with the previous...
105
click to vote
ISCSCT
2008
IEEE
15 years 6 months ago
2008
IEEE
—In this paper, we present a novel method to reconstruct the large scale scenes from multiple calibrated images. It first generates a quasi-dense 3D point cloud of the scene by m...
DAGSTUHL
2004
15 years 1 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
Optimizing combinations of placements of parts, known as markers, is an important preparatory step in order-based industrial production of clothes. Given a work order in the form ...
118
click to vote
CVPR
2009
IEEE
16 years 6 months ago
2009
IEEE
We introduce a new technique that can reduce any
higher-order Markov random field with binary labels into
a first-order one that has the same minima as the original.
Moreover, w...