989 search results - page 68 / 198 » Version spaces and the consistency problem |
SWAT
2010
Springer
14 years 3 months ago
2010
Springer
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...
ASC
2008
13 years 10 months ago
2008
: Discovering interesting patterns or substructures in data streams is an important challenge in data mining. Clustering algorithms are very often applied to identify single substr...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
ENC
2005
IEEE
14 years 3 months ago
2005
IEEE
Generally, evolutionary algorithms require a large number of evaluations of the objective function in order to obtain a good solution. This paper presents a simple approach to sav...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
—In this paper, we introduce a sparse approximation property of order s for a measurement matrix A: xs 2 ≤ D Ax 2 + β σs(x) √ s for all x, where xs is the best s-sparse app...