Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

76

SAC
2010
ACM

151views Applied Computing» more SAC 2010»

A relaxed approach to combinatorial problems in robustness and diagnostics

15 years 1 months ago

A relaxed approach to combinatorial problems in robustness and diagnostics

Download stats-www.open.ac.uk

Frank Critchley, Michaël Schyns, Gentiane Hae

Real-time Traffic

Applied Computing | SAC 2010 |

claim paper

Related Content

» Fast SDP Relaxations of Graph Cut Clustering Transduction and Other Combinatorial Problem

» Lagrangean relaxation with clusters and column generation for the manufacturers pallet loa...

» Adaptive price update in distributed Lagrangian relaxation protocol

» Evaluation of a convex relaxation to a quadratic assignment matching approach for relation...

» Semidefinite Optimization Approaches for Satisfiability and MaximumSatisfiability Problems

» Clique Relaxations in Social Network Analysis The Maximum kPlex Problem

» Generalized RANSAC Framework for Relaxed Correspondence Problems

» ManytoMany Graph Matching a Continuous Relaxation Approach

» Robust binary least squares Relaxations and algorithms

Post Info
More Details (n/a)

Added	30 Jan 2011
Updated	30 Jan 2011
Type	Journal
Year	2010
Where	SAC
Authors	Frank Critchley, Michaël Schyns, Gentiane Haesbroeck, Cécile Fauconnier, Guobing Lu, Richard A. Atkinson, Dong Qian Wang

Comments (0)