247 search results - page 18 / 50 » Scalable propagation-based call graph construction algorithm... |
APVIS
2009
13 years 8 months ago
2009
Many graphs used in real-world applications consist of nodes belonging to more than one category. We call such graph "multiplecategory graphs". Social networks are typic...
ICDM
2009
IEEE
13 years 5 months ago
2009
IEEE
Clustering methods usually require to know the best number of clusters, or another parameter, e.g. a threshold, which is not ever easy to provide. This paper proposes a new graph-b...
IWDC
2005
Springer
14 years 1 months ago
2005
Springer
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—In this paper we consider the problem of constructing minimal cycle-breaking sets of turns for graphs that model communication networks, as a method to prevent deadlocks...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...