4009 search results - page 195 / 802 » Clustering on Complex Graphs |
136
Voted
CIE
2008
Springer
15 years 6 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
136
Voted
ICDM
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...
152
Voted
COR
2010
15 years 4 months ago
2010
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
144
Voted
SIAMSC
2008
15 years 4 months ago
2008
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
135
click to vote
CIKM
2008
Springer
15 years 6 months ago
2008
Springer
This work addresses the use of computational linguistic analysis techniques for conceptual graphs learning from unstructured texts. A technique including both content mining and i...