Sciweavers

161 search results - page 17 / 33
» Structural decompositions for problems with global constrain...
Sort
View
NIPS
2004
14 years 11 months ago
Triangle Fixing Algorithms for the Metric Nearness Problem
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp
63
Voted
CP
2005
Springer
15 years 3 months ago
Partial Redundant Modeling
In the context of previous work on redundant modeling, permutation problems and matrix modeling, we introduce the notion of partial redundant modeling and categorical channeling co...
Tiziana Ligorio, Susan L. Epstein
ICCV
2007
IEEE
15 years 11 months ago
Globally Optimal Affine and Metric Upgrades in Stratified Autocalibration
We present a practical, stratified autocalibration algorithm with theoretical guarantees of global optimality. Given a projective reconstruction, the first stage of the algorithm ...
Manmohan Krishna Chandraker, Sameer Agarwal, David...
ATVA
2004
Springer
146views Hardware» more  ATVA 2004»
15 years 3 months ago
A Global Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata
Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, ...
Tadaaki Tanimoto, Suguru Sasaki, Akio Nakata, Teru...
ISSTA
1998
ACM
15 years 1 months ago
Automatic Test Data Generation Using Constraint Solving Techniques
Automatic test data generation leads to identify input values on which a selected point in a procedure is executed. This paper introduces a new method for this problem based on co...
Arnaud Gotlieb, Bernard Botella, Michel Rueher