200 search results - page 27 / 40 » Fast Computation of Reachability Labeling for Large Graphs |
PODC
2009
ACM
15 years 10 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
JAIR
2006
14 years 9 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
108
click to vote
CPHYSICS
2011
14 years 1 months ago
2011
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. T...
ACL
2009
14 years 7 months ago
2009
We present a graph-based semi-supervised learning for the question-answering (QA) task for ranking candidate sentences. Using textual entailment analysis, we obtain entailment sco...