2060 search results - page 146 / 412 » Some Applications of Coding Theory in Computational Complexi... |
CONCUR
2000
Springer
15 years 2 months ago
2000
Springer
This paper introduces process spaces, a unified theory of interacting systems. The trait, abstract executions, leads to a simple and general set formalism. For concurrent systems ...
103
click to vote
COMPGEOM
2010
ACM
15 years 3 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
PDE solvers using Adaptive Mesh Refinement on block structured grids are some of the most challenging applications to adapt to massively parallel computing environments. We descr...
PODS
2006
ACM
15 years 10 months ago
2006
ACM
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
DSN
2004
IEEE
15 years 1 months ago
2004
IEEE
The authors describe the use of bounded model checking (BMC) for verifying Web application code. Vulnerable sections of code are patched automatically with runtime guards, allowin...