1161 search results - page 24 / 233 » Approximation schemes for clustering problems |
192
click to vote
SDM
2011
SIAM
14 years 13 days ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
SODA
1998
ACM
14 years 11 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
DEXAW
2007
IEEE
15 years 4 months ago
2007
IEEE
In this paper, we examine the application of manifold learning to the clustering problem. The method used is Locality Preserving Projections (LPP), which is chosen because of its ...
MOC
2002
14 years 9 months ago
2002
We study the dynamical behavior of the discontinuous Galerkin finite element method for initial value problems in ordinary differential equations. We make two different assumptions...
IPL
1998
14 years 9 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...