4039 search results - page 517 / 808 » A Method for Dynamic Clustering of Data |
165
click to vote
ESCIENCE
2006
IEEE
16 years 22 days ago
2006
IEEE
Bioinformatics algorithms such as sequence alignment methods based on profile-HMM (Hidden Markov Model) are popular but CPU-intensive. If large amounts of data are processed, a s...
173
click to vote
IJCAI
2003
15 years 8 months ago
2003
Unlike conventional data or text, Web pages typically contain a large amount of information that is not part of the main contents of the pages, e.g., banner ads, navigation bars, ...
186
click to vote
SIAMSC
2008
15 years 6 months ago
2008
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
198
click to vote
CLOUDCOM
2010
Springer
15 years 4 months ago
2010
Springer
Inspired by Darwinian evolution, a genetic algorithm (GA) approach is one of the popular heuristic methods for solving hard problems, such as the Job Shop Scheduling Problem (JSSP...
210
Voted
INFORMATICALT
2011
15 years 1 months ago
2011
Detecting communities in real world networks is an important problem for data analysis in science and engineering. By clustering nodes intelligently, a recursive algorithm is desig...