Sciweavers

4039 search results - page 185 / 808
» A Method for Dynamic Clustering of Data
Sort
View
129
Voted
EUROPAR
2001
Springer
15 years 9 months ago
Self-Organizing Hierarchical Cluster Timestamps
Distributed-system observation tools require an efficient data structure to store and query the partial-order of execution. Such data structures typically use vector timestamps to...
Paul A. S. Ward, David J. Taylor
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
15 years 8 months ago
Flexible constrained spectral clustering
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
Xiang Wang, Ian Davidson
166
Voted
PAMI
2008
161views more  PAMI 2008»
15 years 5 months ago
TRUST-TECH-Based Expectation Maximization for Learning Finite Mixture Models
The Expectation Maximization (EM) algorithm is widely used for learning finite mixture models despite its greedy nature. Most popular model-based clustering techniques might yield...
Chandan K. Reddy, Hsiao-Dong Chiang, Bala Rajaratn...
CVPR
2010
IEEE
16 years 1 months ago
Super-Resolution of Range Data in Dynamic Environments Using a Gaussian Framework
We present a flexible method for fusing information from optical and range sensors based on an accelerated highdimensional filtering approach. Our system takes as input a sequen...
Jennifer Dolson, Jongmin Baek, Christian Plagemann...
MM
2010
ACM
137views Multimedia» more  MM 2010»
15 years 5 months ago
Unsupervised summarization of rushes videos
This paper proposes a new framework to formulate the problem of rushes video summarization as an unsupervised learning problem. We pose the problem of video summarization as one o...
Yang Liu, Feng Zhou, Wei Liu, Fernando De la Torre...