Sciweavers

521 search results - page 14 / 105
» Coring method for clustering a graph
Sort
View
SAC
2005
ACM
15 years 9 months ago
Discovering parametric clusters in social small-world graphs
We present a strategy for analyzing large, social small-world graphs, such as those formed by human networks. Our approach brings together ideas from a number of different resear...
Jonathan McPherson, Kwan-Liu Ma, Michael Ogawa
DAC
2003
ACM
16 years 4 months ago
Partial task assignment of task graphs under heterogeneous resource constraints
This paper presents a novel partial assignment technique (PAT) that decides which tasks should be assigned to the same resource without explicitly defining assignment of these tas...
Radoslaw Szymanek, Krzysztof Kuchcinski
ICPR
2008
IEEE
16 years 5 months ago
Impulse noise removal by spectral clustering and regularization on graphs
In this paper we present a method for impulse noise removal that makes use of spectral clustering and graph regularization. The image is modeled as a graph and local spectral anal...
Olivier Lezoray, Vinh-Thong Ta, Abderrahim Elmoata...
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
15 years 9 months ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar
134
Voted
INCDM
2010
Springer
172views Data Mining» more  INCDM 2010»
15 years 2 months ago
Evaluating the Quality of Clustering Algorithms Using Cluster Path Lengths
Many real world systems can be modeled as networks or graphs. Clustering algorithms that help us to organize and understand these networks are usually referred to as, graph based c...
Faraz Zaidi, Daniel Archambault, Guy Melanç...