1493 search results - page 159 / 299 » Local resilience of graphs |
ICPR
2010
IEEE
13 years 5 months ago
2010
IEEE
We present a method for object tracking over time sequence imagery. The image plane is represented with a 4-connected planar graph where vertices are associated with pixels. On ea...
CC
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. We present a disjoint reachability analysis for Java. Our analysis computes extended points-to graphs annotated with reachability states. Each heap annotated with a set o...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and ...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
This paper investigates compression of 3D objects in computer graphics using manifold learning. Spectral compression uses the eigenvectors of the graph Laplacian of an object'...
CVPR
2007
IEEE
14 years 2 months ago
2007
IEEE
A sketch captures the most informative part of an object, in a much more concise and potentially robust representation (e.g., for face recognition or new capabilities of manipulat...