52 search results - page 2 / 11 » Characterizing Provability in |
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
In the last decade, a great deal of work has been devoted to the elaboration of a sampling theory for smooth surfaces. The goal was to ensure a good reconstruction of a given surf...
ESA
1999
Springer
13 years 10 months ago
1999
Springer
This paper deals with the on-line allocation of shared data objects to the local memory modules of the nodes in a network. We assume that the data is organized in indivisible objec...
ISQED
2007
IEEE
13 years 12 months ago
2007
IEEE
Model order reduction plays a key role in determining VLSI system performance and the optimization of interconnects. In this paper, we develop an accurate and provably passive met...
ENTCS
2007
13 years 5 months ago
2007
We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way f...
WOLLIC
2010
Springer
13 years 10 months ago
2010
Springer
Proof theoretic characterizations of complexity classes are of considerable interest because they link levels of conceptual abstraction to computational complexity. We consider he...