Sciweavers

2827 search results - page 200 / 566
» Robustness of PSPACE-complete sets
Sort
View
JAIR
2000
123views more  JAIR 2000»
15 years 3 months ago
Backbone Fragility and the Local Search Cost Peak
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
Josh Singer, Ian P. Gent, Alan Smaill
TKDE
2010
182views more  TKDE 2010»
15 years 2 months ago
MILD: Multiple-Instance Learning via Disambiguation
In multiple-instance learning (MIL), an individual example is called an instance and a bag contains a single or multiple instances. The class labels available in the training set ...
Wu-Jun Li, Dit-Yan Yeung
CLEF
2009
Springer
15 years 1 months ago
The University of Amsterdam's Concept Detection System at ImageCLEF 2009
Our group within the University of Amsterdam participated in the large-scale visual concept detection task of ImageCLEF 2009. Our experiments focus on increasing the robustness of...
Koen E. A. van de Sande, Theo Gevers, Arnold W. M....
CVPR
2011
IEEE
14 years 11 months ago
Tracking 3D Human Pose with Large Root Node Uncertainty
Representing articulated objects as a graphical model has gained much popularity in recent years, often the root node of the graph describes the global position and orientation of...
Ben Daubney, Xianghua Xie
161
Voted
BMCBI
2011
14 years 7 months ago
Elastic SCAD as a novel penalization method for SVM classification tasks in high-dimensional data
Background: Classification and variable selection play an important role in knowledge discovery in highdimensional data. Although Support Vector Machine (SVM) algorithms are among...
Natalia Becker, Grischa Toedt, Peter Lichter, Axel...