Sciweavers

2219 search results - page 140 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
103
Voted
CP
2006
Springer
15 years 6 months ago
Constraint Satisfaction with Bounded Treewidth Revisited
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
Marko Samer, Stefan Szeider
117
Voted
FCCM
2008
IEEE
176views VLSI» more  FCCM 2008»
15 years 2 months ago
The Effectiveness of Configuration Merging in Point-to-Point Networks for Module-based FPGA Reconfiguration
Communications infrastructure for modular reconfiguration of FPGAs needs to support the changing communications interfaces of a sequence of modules. In order to avoid the overhead...
Shannon Koh, Oliver Diessel
ICPR
2006
IEEE
16 years 3 months ago
Bijective Image Registration using Thin-Plate Splines
Image registration is the process of geometrically aligning two or more images. In this paper we describe a method for registering pairs of images based on thin-plate spline mappi...
156
Voted
CVPR
2008
IEEE
16 years 4 months ago
Shape prior segmentation of multiple objects with graph cuts
We present a new shape prior segmentation method using graph cuts capable of segmenting multiple objects. The shape prior energy is based on a shape distance popular with level se...
Nhat Vu, B. S. Manjunath
103
Voted
IPPS
2003
IEEE
15 years 7 months ago
Sequence Alignment on the Cray MTA-2
The standard algorithm for alignment of DNA sequences using dynamic programming has been implemented on the Cray MTA-2 (Multithreaded Architecture-2) at ENRI (Electronic Navigatio...
Shahid H. Bokhari, Jon R. Sauer