256 search results - page 21 / 52 » Application-Only Call Graph Construction |
111
Voted
COCOON
2007
Springer
15 years 8 months ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
ACCV
2010
Springer
14 years 9 months ago
2010
Springer
The Viewing Graph [1] represents several views linked by the corresponding fundamental matrices, estimated pairwise. Given a Viewing Graph, the tuples of consistent camera matrices...
133
click to vote
BICOB
2009
Springer
15 years 8 months ago
2009
Springer
Here we present a simple method based on graph spectral properties to automatically partition multi-domain proteins into individual domains. The identification of structural domain...
102
click to vote
TSE
2010
15 years 8 days ago
2010
This paper presents an innovative model of a program’s internal behavior over a set of test inputs, called the probabilistic program dependence graph (PPDG), that facilitates pr...
119
Voted
JOT
2007
15 years 1 months ago
2007
Workflow and business process modeling approaches have become essential for designing service collaborations when developing SOA-based systems. To derive actual executable busines...