Sciweavers

189 search results - page 9 / 38
» From Linear Relaxations to Global Constraint Propagation
Sort
View
ICST
2009
IEEE
13 years 6 months ago
Euclide: A Constraint-Based Testing Framework for Critical C Programs
Euclide is a new Constraint-Based Testing tool for verifying safety-critical C programs. By using a mixture of symbolic and numerical analyses (namely static single assignment for...
Arnaud Gotlieb
AUTOMATICA
2008
167views more  AUTOMATICA 2008»
13 years 8 months ago
Stability and robustness analysis of nonlinear systems via contraction metrics and SOS programming
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...
Erin M. Aylward, Pablo A. Parrilo, Jean-Jacques E....
ICCV
2011
IEEE
12 years 8 months ago
Geometrically Consistent Elastic Matching of 3D Shapes: A Linear Programming Solution
We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes. Rather than mapping points to points we match infinitesimal...
Thomas Windheuser, Ulrich Schlickewei, Frank R. Sc...
ICPR
2004
IEEE
14 years 9 months ago
Relaxation Labeling Processes for Protein Secondary Structure Prediction
The prediction of protein secondary structure is a classical problem in bioinformatics, and in the past few years several machine learning techniques have been proposed to t. From...
Giacomo Colle, Marcello Pelillo
NIPS
1997
13 years 10 months ago
Graph Matching with Hierarchical Discrete Relaxation
Our aim in this paper is to develop a Bayesian framework for matching hierarchical relational models. Such models are widespread in computer vision. The framework that we adopt fo...
Richard C. Wilson, Edwin R. Hancock