1227 search results - page 87 / 246 » Approximate Kernel Clustering |
ADCM
2008
14 years 10 months ago
2008
Learning function relations or understanding structures of data lying in manifolds embedded in huge dimensional Euclidean spaces is an important topic in learning theory. In this ...
KDD
2000
ACM
15 years 1 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
AI
2010
Springer
14 years 10 months ago
2010
Springer
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
111
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Compressive sensing accurately reconstructs a signal that is sparse in some basis from measurements, generally consisting of the signal’s inner products with Gaussian random vec...
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
We provide a new comparison between hexagonal and orthogonal lattices, based on approximation theory. For each of the lattices, we select the "natural" spline basis func...