1538 search results - page 12 / 308 » Spectral Techniques in Graph Algorithms |
PAKDD
2011
ACM
12 years 10 months ago
2011
ACM
Abstract. Given a graph with billions of nodes and edges, how can we find patterns and anomalies? Are there nodes that participate in too many or too few triangles? Are there clos...
ISBI
2006
IEEE
14 years 8 months ago
2006
IEEE
This paper develops an algorithm to detect abnormalities of small animals' transplanted hearts in MRI, at early stage of rejection when the hearts do not display prominent ab...
IMAMS
2003
13 years 9 months ago
2003
This paper describes a graph-spectral method for 3D surface integration. The algorithm takes as its input a 2D field of surface normal estimates, delivered, for instance, by a sh...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
Most research on Internet topology is based on active measurement methods. A major difficulty in using these tools is that one comes across many unresponsive routers. Different m...
GBRPR
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we propose an inexact spectral matching algorithm that embeds large graphs on a low-dimensional isometric space spanned by a set of eigenvectors of the graph Laplacia...