Sciweavers

3068 search results - page 98 / 614
» Clustering with Multiple Graphs
Sort
View
IPPS
2003
IEEE
15 years 5 months ago
The Maximal Utilization of Processor Co-Allocation in Multicluster Systems
In systems consisting of multiple clusters of processors which employ space sharing for scheduling jobs, such as our Distributed ASCI1 Supercomputer (DAS), coallocation, i.e., the...
Anca I. D. Bucur, Dick H. J. Epema
91
Voted
WWW
2007
ACM
16 years 1 months ago
On building graphs of documents with artificial ants
We present an incremental algorithm for building a neighborhood graph from a set of documents. This algorithm is based on a population of artificial agents that imitate the way re...
Hanane Azzag, Julien Lavergne, Christiane Guinot, ...
WAW
2009
Springer
138views Algorithms» more  WAW 2009»
15 years 7 months ago
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Kevin J. Lang
94
Voted
CPM
2004
Springer
156views Combinatorics» more  CPM 2004»
15 years 6 months ago
A Computational Model for RNA Multiple Structural Alignment.
Abstract. This paper addresses the problem of aligning multiple sequences of non-coding RNA genes. We approach this problem with the biologically motivated paradigm that scoring of...
Eugene Davydov, Serafim Batzoglou
WIRN
2005
Springer
15 years 6 months ago
Ensembles Based on Random Projections to Improve the Accuracy of Clustering Algorithms
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
Alberto Bertoni, Giorgio Valentini