53 search results - page 8 / 11 » An Empirical Study of Static Call Graph Extractors |
JMLR
2010
13 years 2 months ago
2010
We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...
ICDM
2007
IEEE
14 years 1 months ago
2007
IEEE
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
ICTAI
2006
IEEE
14 years 1 months ago
2006
IEEE
The discovery of objects with exceptional behavior is an important challenge from a knowledge discovery standpoint and has attracted much attention recently. In this paper, we pre...
FLAIRS
2004
13 years 9 months ago
2004
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
IPSN
2010
Springer
14 years 2 months ago
2010
Springer
We study the utility of dynamic frequency agility in realworld wireless sensor networks. Many view such agility as essential to obtaining adequate reliability in industrial enviro...