Sciweavers

2463 search results - page 172 / 493
» Rankings of Directed Graphs
Sort
View
PROPERTYTESTING
2010
13 years 7 months ago
Transitive-Closure Spanners: A Survey
We survey results on transitive-closure spanners and their applications. Given a directed graph G = (V, E) and an integer k 1, a k-transitive-closure-spanner (k-TC-spanner) of G ...
Sofya Raskhodnikova
AIPS
2008
14 years 19 hour ago
Unifying the Causal Graph and Additive Heuristics
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...
Malte Helmert, Hector Geffner
SIMULATION
2008
139views more  SIMULATION 2008»
13 years 9 months ago
Constitutive Hybrid Processes: a Process-Algebraic Semantics for Hybrid Bond Graphs
Models of physical systems have to be based on physical principles such as conservation of energy and continuity of power. These principles are inherently enforced by the bond gra...
Pieter J. L. Cuijpers, Jan F. Broenink, Pieter J. ...
PVLDB
2010
151views more  PVLDB 2010»
13 years 8 months ago
Scalable Discovery of Best Clusters on Large Graphs
The identiļ¬cation of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ļ...
Kathy Macropol, Ambuj K. Singh
INFOCOM
2008
IEEE
14 years 4 months ago
A Trust and Reputation based Anti-SPIM Method
ā€”Instant Messaging (IM) service is a killer application in the Internet. Due to the problem of IM spam (SPIM), building an effective anti-spim method is an important research top...
Jun Bi, Jianping Wu, Wenmao Zhang