227 search results - page 11 / 46 » Fitting a graph to vector data |
KDD
2001
ACM
15 years 10 months ago
2001
ACM
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
DAWAK
2007
Springer
15 years 4 months ago
2007
Springer
Representative-based clustering algorithms are quite popular due to their relative high speed and because of their sound theoretical foundation. On the other hand, the clusters the...
100
click to vote
ICDAR
2011
IEEE
13 years 9 months ago
2011
IEEE
—We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a re...
92
Voted
CVPR
2004
IEEE
16 years 4 days ago
2004
IEEE
In this paper a method for fitting open surfaces to an unorganized set of data points is presented using a level set representation of the surface. This is done by tracking a curv...
CVPR
2008
IEEE
16 years 4 days ago
2008
IEEE
Given a finite number of data points sampled from a low-dimensional manifold embedded in a high dimensional space together with the parameter vectors for a subset of the data poin...