5046 search results - page 308 / 1010 » Non-redundant data clustering |
183
click to vote
NOSSDAV
2009
Springer
16 years 1 months ago
2009
Springer
A critical problem in implementing interactive perception applications is the considerable computational cost of current computer vision and machine learning algorithms, which typ...
236
click to vote
CHI
2008
ACM
15 years 8 months ago
2008
ACM
We present a large-scale analysis of the content of weblogs dating back to the release of the Blogger program in 1999. Over one million blogs were analyzed from their conception t...
160
click to vote
FUZZIEEE
2007
IEEE
16 years 1 months ago
2007
IEEE
— Recently several algorithms for clustering large data sets or streaming data sets have been proposed. Most of them address the crisp case of clustering, which cannot be easily ...
188
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
While there is a very long tradition of approximating a data array by projecting row or column vectors into a lower dimensional subspace the direct approximation of a data matrix ...
173
click to vote
IEEEPACT
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper presents a new modulo scheduling algorithm for clustered microarchitectures. The main feature of the proposed scheme is that the assignment of instructions to clusters ...