256 search results - page 10 / 52 » Application-Only Call Graph Construction |
ICCSA
2007
Springer
14 years 4 months ago
2007
Springer
Computational origami is the computer assisted study of origami as a branch of science of shapes. The origami construction is a countably finite sequence of fold steps, each consi...
CSE
2009
IEEE
14 years 4 months ago
2009
IEEE
The current set of social networking platforms, e.g. Facebook and MySpace, has created a new class of Internet applications called social software. These systems focus on leveragi...
TOG
2002
13 years 9 months ago
2002
In this paper we present a novel method for creating realistic, controllable motion. Given a corpus of motion capture data, we automatically construct a directed graph called a mo...
ICPP
1995
IEEE
14 years 1 months ago
1995
IEEE
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...
DM
2008
13 years 10 months ago
2008
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1, . . . , vk of G, there exists a cycle (respectively, a hamilton...