256 search results - page 23 / 52 » Application-Only Call Graph Construction |
114
click to vote
JOIN
2007
15 years 1 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
CCCG
2009
15 years 3 months ago
2009
The point placement problem is to determine the positions of a linear set of points, P = {p1, p2, p3, . . . , pn}, uniquely, up to translation and reflection, from the fewest poss...
116
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
127
click to vote
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
In this paper, we present a new framework for non-rigid structure from motion (NRSFM) that simultaneously addresses three significant challenges: severe occlusion, perspective ca...
113
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...