Sciweavers

2137 search results - page 135 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
SIROCCO
2008
14 years 11 months ago
Recovering the Long-Range Links in Augmented Graphs
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
BMCBI
2006
134views more  BMCBI 2006»
14 years 10 months ago
An approach for clustering gene expression data with error information
Background: Clustering of gene expression patterns is a well-studied technique for elucidating trends across large numbers of transcripts and for identifying likely co-regulated g...
Brian Tjaden
COR
2006
65views more  COR 2006»
14 years 10 months ago
An exact method for graph coloring
We are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to...
Corinne Lucet, Florence Mendes, Aziz Moukrim
CLEF
2010
Springer
14 years 11 months ago
TALP at WePS-3 2010
In this paper we present our system and experiments at the Third Web People Search Workshop (WePS-3) task for clustering web people search documents in English. In our experiments ...
Daniel Ferrés, Horacio Rodríguez
ATAL
2005
Springer
15 years 3 months ago
Tunably decentralized algorithms for cooperative target observation
Multi-agent problem domains may require distributed algorithms for a variety of reasons: local sensors, limitations of communication, and availability of distributed computational...
Sean Luke, Keith Sullivan, Liviu Panait, Gabriel C...