53 search results - page 5 / 11 » Optimal Partitions of Data In Higher Dimensions |
COMPGEOM
2010
ACM
14 years 17 days ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
VLDB
1999
ACM
1999
ACM
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
13 years 11 months ago
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
PR
2007
13 years 7 months ago
2007
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
TWC
2008
13 years 7 months ago
2008
In this paper a single-input-single-output wireless data transmission system with adaptive modulation and coding over correlated fading channel is considered, where run-time power ...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
We propose an ℓ1 criterion for dictionary learning for sparse signal representation. Instead of directly searching for the dictionary vectors, our dictionary learning approach i...