15494 search results - page 188 / 3099 » Computing dynamic clusters |
192
click to vote
PAMI
2008
15 years 6 months ago
2008
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...
172
click to vote
ICSE
2004
IEEE-ACM
16 years 6 months ago
2004
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...
190
click to vote
WEBI
2007
Springer
16 years 10 days ago
2007
Springer
Detecting densely connected subgroups in graphs such as communities in social networks is of interest in many research fields. Several methods have been developed to find commun...
159
click to vote
GCC
2003
Springer
15 years 11 months ago
2003
Springer
Basic exploration of diffusion equation solvers in distributed computing systems has been a very important issue for computational fluid dynamics (CFD). This paper presents a funda...
146
click to vote
CLUSTER
2003
IEEE
15 years 11 months ago
2003
IEEE
Extendible hashing is a kind of fast indexing technology; it provides with a way of storing structural data records so that each of them can be gotten very quickly. In this paper,...