Sciweavers

6833 search results - page 231 / 1367
» Some two-character sets
Sort
View
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
16 years 7 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto
GECCO
2009
Springer
109views Optimization» more  GECCO 2009»
16 years 1 months ago
Canonical representation genetic programming
Search spaces sampled by the process of Genetic Programming often consist of programs which can represent a function in many different ways. Thus, when the space is examined it i...
John R. Woodward, Ruibin Bai
ICALP
2010
Springer
15 years 11 months ago
Thresholded Covering Algorithms for Robust and Max-min Optimization
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
Anupam Gupta, Viswanath Nagarajan, R. Ravi
ICDM
2010
IEEE
168views Data Mining» more  ICDM 2010»
15 years 4 months ago
Anomaly Detection Using an Ensemble of Feature Models
We present a new approach to semi-supervised anomaly detection. Given a set of training examples believed to come from the same distribution or class, the task is to learn a model ...
Keith Noto, Carla E. Brodley, Donna K. Slonim
ISCA
2008
IEEE
92views Hardware» more  ISCA 2008»
16 years 1 months ago
Counting Dependence Predictors
Modern processors rely on memory dependence prediction to execute load instructions as early as possible, speculating that they are not dependent on an earlier, unissued store. To...
Franziska Roesner, Doug Burger, Stephen W. Keckler