847 search results - page 142 / 170 » Approximation algorithms for projective clustering |
ESA
2005
Springer
15 years 4 months ago
2005
Springer
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
There are many innovative proposals introduced in the literature under the evolutionary computation field, from which estimation of distribution algorithms (EDAs) is one of them....
SIGUCCS
2000
ACM
15 years 2 months ago
2000
ACM
This paper discusses the technical and policy issues that West Virginia Network (WVNET) encountered when it expanded its statewide Internet dialup service through an outsourcing p...
105
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We propose a new approach to value function approximation which combines linear temporal difference reinforcement learning with subspace identification. In practical applications...
121
click to vote
ADBIS
2007
Springer
15 years 5 months ago
2007
Springer
The method of self-organizing maps (SOM) is a method of exploratory data analysis used for clustering and projecting multi-dimensional data into a lower-dimensional space to reveal...