Sciweavers

1617 search results - page 124 / 324
» Constraints in Weighted Averaging
Sort
View
CVPR
2010
IEEE
16 years 1 months ago
Variational Segmentation of Volumetric Elongated Objects
We present an interactive approach for segmenting thin volumetric structures. The proposed segmentation model is based on an anisotropic weighted Total Variation energy with a glob...
Christian Reinbacher, Thomas Pock, Christian Bauer...
IWCM
2004
Springer
15 years 11 months ago
Towards a Multi-camera Generalization of Brightness Constancy
Standard optical flow methods for motion or disparity estimation use a brightness constancy constraint equation (BCCE). This BCCE either handles a moving camera imaging a non-movi...
Hanno Scharr
CPAIOR
2010
Springer
15 years 11 months ago
Upper Bounds on the Number of Solutions of Binary Integer Programs
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
Siddhartha Jain, Serdar Kadioglu, Meinolf Sellmann
NETWORKS
2008
15 years 6 months ago
Lagrangian relaxation and enumeration for solving constrained shortest-path problems
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
W. Matthew Carlyle, Johannes O. Royset, R. Kevin W...
JAIR
2010
99views more  JAIR 2010»
15 years 4 months ago
Developing Approaches for Solving a Telecommunications Feature Subscription Problem
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...