Sciweavers

299 search results - page 7 / 60
» Optimizing Polynomial Solvers for Minimal Geometry Problems
Sort
View
ACSD
2007
IEEE
102views Hardware» more  ACSD 2007»
14 years 1 months ago
Sensor Minimization Problems with Static or Dynamic Observers for Fault Diagnosis
We study sensor minimization problems in the context of fault diagnosis. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in...
Franck Cassez, Stavros Tripakis, Karine Altisen
CVPR
2012
IEEE
11 years 10 months ago
What is optimized in tight convex relaxations for multi-label problems?
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...
Christopher Zach, Christian Hane, Marc Pollefeys
AUTOMATICA
2010
94views more  AUTOMATICA 2010»
13 years 7 months ago
Optimality analysis of sensor-target localization geometries
The problem of target localization involves estimating the position of a target from multiple and typically noisy measurements of the target position. It is well known that the re...
Adrian N. Bishop, Baris Fidan, Brian D. O. Anderso...
JMLR
2010
143views more  JMLR 2010»
13 years 6 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...
ICSE
2009
IEEE-ACM
14 years 2 months ago
MINTS: A general framework and tool for supporting test-suite minimization
Regression test suites tend to grow over time as new test cases are added to exercise new functionality or to target newly-discovered faults. When test suites become too large, th...
Hwa-You Hsu, Alessandro Orso