4865 search results - page 487 / 973 » The Complexity of Graph Connectivity |
226
click to vote
CONCUR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
181
click to vote
IPPS
2006
IEEE
16 years 1 months ago
2006
IEEE
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
233
click to vote
INFOVIS
2005
IEEE
16 years 17 days ago
2005
IEEE
We present a system that allows users to interactively explore complex flow scenarios represented as Sankey diagrams. Our system provides an overview of the flow graph and allows ...
188
click to vote
ESOP
2009
Springer
15 years 11 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
199
click to vote
JMLR
2010
15 years 1 months ago
2010
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...