4486 search results - page 93 / 898 » Adaptable Boundary Sets |
125
click to vote
IJCAI
2003
15 years 5 months ago
2003
Single-Class Classification (SCC) seeks to distinguish one class of data from the universal set of multiple classes. We present a new SCC algorithm that efficiently computes an ac...
153
click to vote
PR
2008
15 years 4 months ago
2008
Our goal is to design algorithms that give a linearity measure for planar point sets. There is no explicit discussion on linearity in literature, although some existing shape meas...
180
click to vote
ICPP
2000
IEEE
15 years 9 months ago
2000
IEEE
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
129
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Solving stochastic optimization problems under partial observability, where one needs to adaptively make decisions with uncertain outcomes, is a fundamental but notoriously diffic...
136
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...