Sciweavers

2219 search results - page 289 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
CVPR
2004
IEEE
16 years 5 months ago
Globally Optimal Segmentation of Interacting Surfaces with Geometric Constraints
Abstract-- Efficient detection of globally optimal surfaces representing object boundaries in volumetric datasets is important and remains challenging in many medical image analysi...
Kang Li, Xiaodong Wu, Danny Z. Chen, Milan Sonka
CP
2005
Springer
15 years 8 months ago
Automatic Detection of Variable and Value Symmetries
Abstract. Many symmetry breaking techniques assume that the symmetries of a CSP are given as input in addition to the CSP itself. We present a method that can be used to detect all...
Jean-Francois Puget
CORR
2011
Springer
172views Education» more  CORR 2011»
14 years 10 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
TCBB
2010
104views more  TCBB 2010»
15 years 1 months ago
Fast Hinge Detection Algorithms for Flexible Protein Structures
— Analysis of conformational changes is one of the keys to the understanding of protein functions and interactions. For the analysis, we often compare two protein structures, tak...
Tetsuo Shibuya
128
Voted
CCGRID
2001
IEEE
15 years 6 months ago
An Adaptive, Reconfigurable Interconnect for Computational Clusters
This paper describes the principles of an original adaptive interconnect for a computational cluster. Torus topology (2d or 3d) is used as a basis but nodes are allowed to effecti...
Alexander V. Shafarenko, Vladimir Vasekin