Sciweavers

688 search results - page 58 / 138
» Reverse Tree Clustering
Sort
View
ICDM
2009
IEEE
167views Data Mining» more  ICDM 2009»
13 years 5 months ago
Self-Adaptive Anytime Stream Clustering
Clustering streaming data requires algorithms which are capable of updating clustering results for the incoming data. As data is constantly arriving, time for processing is limited...
Philipp Kranen, Ira Assent, Corinna Baldauf, Thoma...
NAACL
1994
13 years 9 months ago
Tree-Based State Tying for High Accuracy Modelling
The key problem to be faced when building a HMM-based continuous speech recogniser is maintaining the balance between model complexity and available training data. For large vocab...
S. J. Young, J. J. Odell, Philip C. Woodland
RSA
2010
89views more  RSA 2010»
13 years 6 months ago
A system of grabbing particles related to Galton-Watson trees
We consider a system of particles with arms that are activated randomly to grab other particles as a toy model for polymerization. We assume that the following two rules are fulï¬...
Jean Bertoin, Vladas Sidoravicius, Maria Eulalia V...
MMM
2007
Springer
123views Multimedia» more  MMM 2007»
14 years 2 months ago
Tamper Proofing 3D Motion Data Streams
This paper presents a fragile watermarking technique to tamper proof (Mocap) motion capture data. The technique visualizes 3D Mocap data as a series of cluster of points. Watermark...
Parag Agarwal, Balakrishnan Prabhakaran
IV
2009
IEEE
128views Visualization» more  IV 2009»
14 years 2 months ago
Large Quasi-Tree Drawing: A Neighborhood Based Approach
In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects ha...
Romain Bourqui, David Auber