3105 search results - page 201 / 621 » The Path-Packing Structure of Graphs |
109
click to vote
SLP
1997
15 years 5 months ago
1997
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are am...
134
Voted
ACL
2010
15 years 1 months ago
2010
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed ed...
137
Voted
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
133
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
129
Voted
ICCS
1998
Springer
15 years 8 months ago
1998
Springer
Internet-based information technologies have considerable potential for improving collaboration in professional communities. In this paper, we explain the concept of user-driven sp...