Sciweavers

537 search results - page 43 / 108
» Methods for Evolving Robust Programs
Sort
View
NIPS
2004
13 years 10 months ago
A Second Order Cone programming Formulation for Classifying Missing Data
We propose a convex optimization based strategy to deal with uncertainty in the observations of a classification problem. We assume that instead of a sample (xi, yi) a distributio...
Chiranjib Bhattacharyya, Pannagadatta K. Shivaswam...
ICPR
2010
IEEE
14 years 1 months ago
Learning an Efficient and Robust Graph Matching Procedure for Specific Object Recognition
We present a fast and robust graph matching approach for 2D specific object recognition in images. From a small number of training images, a model graph of the object to learn is a...
Jerome Revaud, Guillaume Lavoue, Yasuo Ariki, Atil...
AAAI
2006
13 years 10 months ago
Robust Support Vector Machine Training via Convex Outlier Ablation
One of the well known risks of large margin training methods, such as boosting and support vector machines (SVMs), is their sensitivity to outliers. These risks are normally mitig...
Linli Xu, Koby Crammer, Dale Schuurmans
AUSAI
2004
Springer
14 years 2 months ago
A New Neighborhood Based on Improvement Graph for Robust Graph Coloring Problem
In this paper, we propose a new neighborhood structure based on the improvement graph for solving the Robust Graph Coloring Problem, an interesting extension of classical graph col...
Songshan Guo, Ying Kong, Andrew Lim, Fan Wang
EURODAC
1994
IEEE
148views VHDL» more  EURODAC 1994»
14 years 1 months ago
BiTeS: a BDD based test pattern generator for strong robust path delay faults
This paper presents an algorithm for generation of test patterns for strong robust path delay faults, i.e. tests that propagate the fault along a single path and additionally are ...
Rolf Drechsler