3068 search results - page 170 / 614 » Clustering with Multiple Graphs |
143
click to vote
SIAMSC
2008
15 years 3 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...
131
click to vote
ESA
1999
Springer
15 years 8 months ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
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...
154
click to vote
JMM2
2007
15 years 3 months ago
2007
— This paper makes new contributions in motion detection, object segmentation and trajectory estimation to create a successful object tracking system. A new efficient motion det...
126
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we explore experimentally the use of the commute time of the continuous-time quantum walk for graph drawing. For the classical random walk, the commute time has bee...