Sciweavers

919 search results - page 21 / 184
» Standard Data Representations for VLSI Algorithm Development
Sort
View
CORR
2004
Springer
152views Education» more  CORR 2004»
14 years 9 months ago
Non-negative matrix factorization with sparseness constraints
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...
Patrik O. Hoyer
ICA
2007
Springer
15 years 1 months ago
Infinite Sparse Factor Analysis and Infinite Independent Components Analysis
Abstract. A nonparametric Bayesian extension of Independent Components Analysis (ICA) is proposed where observed data Y is modelled as a linear superposition, G, of a potentially i...
David Knowles, Zoubin Ghahramani
INTERACTION
2009
ACM
15 years 2 months ago
RoboEarth: connecting robots worldwide
In this paper, we present the core concept and the benefits of an approach called RoboEarth which will be highly beneficial for future robotic applications in science and industry...
Oliver Zweigle, René van de Molengraft, Raf...
PAKDD
2005
ACM
146views Data Mining» more  PAKDD 2005»
15 years 3 months ago
An Incremental Data Stream Clustering Algorithm Based on Dense Units Detection
Abstract. The data stream model of computation is often used for analyzing huge volumes of continuously arriving data. In this paper, we present a novel algorithm called DUCstream ...
Jing Gao, Jianzhong Li, Zhaogong Zhang, Pang-Ning ...

Publication
417views
15 years 6 months ago
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
Peter N. Yianilos