Sciweavers

2374 search results - page 43 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
JMLR
2010
115views more  JMLR 2010»
13 years 2 months ago
Fast and Scalable Local Kernel Machines
A computationally efficient approach to local learning with kernel methods is presented. The Fast Local Kernel Support Vector Machine (FaLK-SVM) trains a set of local SVMs on redu...
Nicola Segata, Enrico Blanzieri
GECCO
2006
Springer
202views Optimization» more  GECCO 2006»
13 years 11 months ago
Evolving hash functions by means of genetic programming
The design of hash functions by means of evolutionary computation is a relatively new and unexplored problem. In this work, we use Genetic Programming (GP) to evolve robust and fa...
César Estébanez, Julio César ...
KAIS
2006
126views more  KAIS 2006»
13 years 7 months ago
Fast and exact out-of-core and distributed k-means clustering
Clustering has been one of the most widely studied topics in data mining and k-means clustering has been one of the popular clustering algorithms. K-means requires several passes ...
Ruoming Jin, Anjan Goswami, Gagan Agrawal
EDBT
2011
ACM
281views Database» more  EDBT 2011»
12 years 11 months ago
Fast and accurate computation of equi-depth histograms over data streams
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
Hamid Mousavi, Carlo Zaniolo
ICASSP
2011
IEEE
12 years 11 months ago
Nonstationary and temporally correlated source separation using Gaussian process
Blind source separation (BSS) is a process to reconstruct source signals from the mixed signals. The standard BSS methods assume a fixed set of stationary source signals with the ...
Hsin-Lung Hsieh, Jen-Tzung Chien