4009 search results - page 119 / 802 » Clustering on Complex Graphs |
119
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
123
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
126
Voted
WDAG
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
125
click to vote
WWW
2007
ACM
16 years 4 months ago
2007
ACM
We present an incremental algorithm for building a neighborhood graph from a set of documents. This algorithm is based on a population of artificial agents that imitate the way re...
157
Voted
IJCNN
2000
IEEE
15 years 8 months ago
2000
IEEE
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...