1227 search results - page 61 / 246 » Approximate Kernel Clustering |
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
—The realistic performance of a multi-input multi-output (MIMO) communication system depends strongly on the spatial correlation properties introduced by clustering in the propag...
KDD
2005
ACM
15 years 10 months ago
2005
ACM
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
ORDER
2008
14 years 9 months ago
2008
For a Heyting algebra A, we show that the following conditions are equivalent: (i) A is profinite; (ii) A is finitely approximable, complete, and completely join-prime generated; (...
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper, we propose new sampling schemes for classes of 2-D signals with finite rate of innovation (FRI). In particular, we consider sets of 2-D Diracs and bilevel polygons....
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...