247 search results - page 40 / 50 » Scalable propagation-based call graph construction algorithm... |
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
ICSE
2008
IEEE-ACM
14 years 8 months ago
2008
IEEE-ACM
WS-BPEL applications are a kind of service-oriented application. They use XPath extensively to integrate loosely-coupled workflow steps. However, XPath may extract wrong data from...
ICDM
2008
IEEE
14 years 2 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 2 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...
DISOPT
2011
13 years 2 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...