705 search results - page 61 / 141 » Proximity Cluster Trees |
ICDM
2009
IEEE
13 years 5 months ago
2009
IEEE
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...
NAACL
1994
13 years 9 months ago
1994
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...
RSA
2010
13 years 6 months ago
2010
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ï¬...
IV
2009
IEEE
14 years 2 months ago
2009
IEEE
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...
PVM
2007
Springer
14 years 1 months ago
2007
Springer
We present a new, simple algorithmic idea for exploiting the potential for bidirectional communication present in many modern interconnects for the collective MPI operations broadc...