5046 search results - page 261 / 1010 » Non-redundant data clustering |
166
click to vote
TSP
2011
15 years 1 months ago
2011
Abstract—Mapping stationary objects is essential for autonomous vehicles and many autonomous functions in vehicles. In this contribution the probability hypothesis density (PHD) ...
184
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
The K-means clustering problem seeks to partition the columns of a data matrix in subsets, such that columns in the same subset are ‘close’ to each other. The co-clustering pr...
190
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
While crowds of various subjects may offer applicationspecific cues to detect individuals, we demonstrate that for the general case, motion itself contains more information than p...
166
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
Many clustering algorithms fail when dealing with high dimensional data. Principal component analysis (PCA) is a popular dimensionality reduction algorithm. However, it assumes a ...
219
click to vote
ICDE
2012
IEEE
13 years 9 months ago
2012
IEEE
—“Big Data” in map-reduce (M-R) clusters is often fundamentally temporal in nature, as are many analytics tasks over such data. For instance, display advertising uses Behavio...