Sciweavers

278 search results - page 26 / 56
» Algorithmic randomness and monotone complexity on product sp...
Sort
View
NIPS
1998
13 years 9 months ago
A Polygonal Line Algorithm for Constructing Principal Curves
Principal curves have been defined as "self consistent" smooth curves which pass through the "middle" of a d-dimensional probability distribution or data cloud...
Balázs Kégl, Adam Krzyzak, Tam&aacut...
JMLR
2008
117views more  JMLR 2008»
13 years 8 months ago
Active Learning by Spherical Subdivision
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...
Falk-Florian Henrich, Klaus Obermayer
GECCO
2006
Springer
141views Optimization» more  GECCO 2006»
14 years 4 days ago
Coevolution of neural networks using a layered pareto archive
The Layered Pareto Coevolution Archive (LAPCA) was recently proposed as an effective Coevolutionary Memory (CM) which, under certain assumptions, approximates monotonic progress i...
German A. Monroy, Kenneth O. Stanley, Risto Miikku...
ICTAI
2006
IEEE
14 years 2 months ago
Sustained Emerging Spatio-Temporal Co-occurrence Pattern Mining: A Summary of Results
Sustained emerging spatio-temporal co-occurrence patterns (SECOPs) represent subsets of object-types that are increasingly located together in space and time. Discovering SECOPs i...
Mete Celik, Shashi Shekhar, James P. Rogers, James...
PODS
2006
ACM
95views Database» more  PODS 2006»
14 years 8 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...