Sciweavers

232 search results - page 16 / 47
» Dynamic Graph Clustering Using Minimum-Cut Trees
Sort
View
PPAM
2005
Springer
14 years 6 days ago
Scheduling Moldable Tasks for Dynamic SMP Clusters in SoC Technology
Abstract. The paper presents an algorithm for scheduling parallel programs for execution in a parallel architecture based on dynamic SMP processor clusters with data transfers on t...
Lukasz Masko, Pierre-François Dutot, Gregor...
IDEAL
2007
Springer
14 years 26 days ago
Topological Tree Clustering of Social Network Search Results
In the information age, online collaboration and social networks are of increasing importance and quickly becoming an integral part of our lifestyle. In business, social networking...
Richard T. Freeman
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
14 years 5 days ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
ISMB
1993
13 years 8 months ago
Computationally Efficient Cluster Representation in Molecular Sequence Megaclassification
Molecular sequence megaclassification is a technique for automated protein sequence analysis and annotation. Implementation of the method has been limited by the need to store and...
David J. States, Nomi L. Harris, Lawrence Hunter
ALMOB
2006
89views more  ALMOB 2006»
13 years 6 months ago
On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
Katharina Anna Lehmann, Michael Kaufmann, Stephan ...