Sciweavers

105 search results - page 1 / 21
» Multiconsistency and Robustness with Global Constraints
Sort
View
CPAIOR
2005
Springer
14 years 1 months ago
Multiconsistency and Robustness with Global Constraints
We propose a natural generalization of arc-consistency, which we call multiconsistency: A value v in the domain of a variable x is kmulticonsistent with respect to a constraint C i...
Khaled M. Elbassioni, Irit Katriel
JSCIC
2008
62views more  JSCIC 2008»
13 years 7 months ago
Robustness of a Spline Element Method with Constraints
The spline element method with constraints is a discretization method where the unknowns are expanded as polynomials on each element and Lagrange multipliers are used to enforce th...
Gerard Awanou
ICPR
2000
IEEE
14 years 8 months ago
Robust Dense Matching Using Local and Global Geometric Constraints
A new robust dense matching algorithm is introduced in this paper. The algorithm starts from matching the most textured points, then a match propagation algorithm is developed wit...
Maxime Lhuillier, Long Quan
MVA
2000
166views Computer Vision» more  MVA 2000»
13 years 9 months ago
Motion Segmentation and Tracking by Embedding Global Model Within a Contextual Relaxation Scheme
IAPR Workshop on Machine Vision and Applications, pp. 455-458, 2000, Tokyo, Japan In this paper, we integrate the model-based tracking and local contexture (temporal and spatial) ...
Yunqiang Chen, Thomas S. Huang
TCOM
2010
91views more  TCOM 2010»
13 years 6 months ago
Robust Power Allocation Algorithms for Wireless Relay Networks
—Resource allocation promises significant benefits in wireless networks. In order to fully reap these benefits, it is important to design efficient resource allocation algori...
Tony Q. S. Quek, Moe Z. Win, Marco Chiani