256 search results - page 37 / 52 » Application-Only Call Graph Construction |
ICDM
2008
IEEE
14 years 4 months ago
2008
IEEE
In this paper, we present a novel feature extraction framework, called learning by propagability. The whole learning process is driven by the philosophy that the data labels and o...
SCAM
2008
IEEE
14 years 4 months ago
2008
IEEE
Aspect-Oriented Programming (AOP) strives to localize the scattered and tangled implementations of crosscutting concerns (CCCs) by allowing developers to declare that certain acti...
ICALP
2004
Springer
14 years 3 months ago
2004
Springer
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
COMPGEOM
2008
ACM
13 years 11 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
DISOPT
2011
13 years 4 months ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...