Sciweavers

600 search results - page 40 / 120
» Problems and results in extremal combinatorics - II
Sort
View
MICAI
2004
Springer
15 years 6 months ago
An Optimization Algorithm Based on Active and Instance-Based Learning
We present an optimization algorithm that combines active learning and locally-weighted regression to find extreme points of noisy and complex functions. We apply our algorithm to...
Olac Fuentes, Thamar Solorio
DATE
2002
IEEE
94views Hardware» more  DATE 2002»
15 years 6 months ago
Exact Grading of Multiple Path Delay Faults
The problem of fault grading for multiple path delay faults is studied and a method of obtaining the exact coverage is presented. The faults covered are represented and manipulate...
Saravanan Padmanaban, Spyros Tragoudas
KDD
1995
ACM
216views Data Mining» more  KDD 1995»
15 years 5 months ago
Robust Decision Trees: Removing Outliers from Databases
Finding and removingoutliers is an important problem in data mining. Errors in large databases can be extremely common,so an important property of a data mining algorithm is robus...
George H. John
NIPS
2008
15 years 2 months ago
Spectral Hashing
Semantic hashing[1] seeks compact binary codes of data-points so that the Hamming distance between codewords correlates with semantic similarity. In this paper, we show that the p...
Yair Weiss, Antonio Torralba, Robert Fergus
IJCAI
2003
15 years 2 months ago
Making the Breakout Algorithm Complete Using Systematic Search
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
Carlos Eisenberg, Boi Faltings