Sciweavers

2137 search results - page 103 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
ICST
2010
IEEE
13 years 8 months ago
GraphSeq: A Graph Matching Tool for the Extraction of Mobility Patterns
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...
Minh Duc Nguyen, Hélène Waeselynck, ...
TCS
2010
13 years 9 months ago
Clustering with partial information
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...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...
EMNLP
2008
14 years 4 days ago
Who is Who and What is What: Experiments in Cross-Document Co-Reference
This paper describes a language-independent, scalable system for both challenges of crossdocument co-reference: name variation and entity disambiguation. We provide system results...
Alex Baron, Marjorie Freedman
WEA
2009
Springer
126views Algorithms» more  WEA 2009»
14 years 5 months ago
Measuring the Similarity of Geometric Graphs
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...
Otfried Cheong, Joachim Gudmundsson, Hyo-Sil Kim, ...
EDBT
2008
ACM
206views Database» more  EDBT 2008»
14 years 10 months ago
Designing an inductive data stream management system: the stream mill experience
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...
Hetal Thakkar, Barzan Mozafari, Carlo Zaniolo