2137 search results - page 103 / 428 » Experiments on Graph Clustering Algorithms |
121
click to vote
ICST
2010
IEEE
14 years 10 months ago
2010
IEEE
Mobile computing systems provide new challenges for verification. One of them is the dynamicity of the system structure, with mobility-induced connections and disconnections, dynam...
107
click to vote
TCS
2010
14 years 10 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
104
click to vote
EMNLP
2008
15 years 1 months ago
2008
This paper describes a language-independent, scalable system for both challenges of crossdocument co-reference: name variation and entity disambiguation. We provide system results...
100
click to vote
WEA
2009
Springer
15 years 7 months ago
2009
Springer
What does it mean for two geometric graphs to be similar? We propose a distance for geometric graphs that we show to be a metric, and that can be computed by solving an integer li...
112
click to vote
EDBT
2008
ACM
16 years 12 days ago
2008
ACM
There has been much recent interest in on-line data mining. Existing mining algorithms designed for stored data are either not applicable or not effective on data streams, where r...