Sciweavers

1893 search results - page 229 / 379
» Computational composites
Sort
View
FOCS
2004
IEEE
14 years 2 months ago
Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem
In this work we look back into the proof of the PCP Theorem, with the goal of finding new proofs that are "more combinatorial" and arguably simpler. For that we introduc...
Irit Dinur, Omer Reingold
IFIPTCS
2000
14 years 2 months ago
Open Ended Systems, Dynamic Bisimulation and Tile Logic
Abstract The sos formats ensuring that bisimilarity is a congruence often fail in the presence of structural axioms on the algebra of states. Dynamic bisimulation, introduced to ch...
Roberto Bruni, Ugo Montanari, Vladimiro Sassone
RT
2000
Springer
14 years 2 months ago
Interactive Rendering with Real-World Illumination
We propose solutions for seamlessly integrating synthetic objects into background photographs at interactive rates. Recently developed image-based methods are used to capture real...
Simon Gibson, Alan Murta
DAC
1995
ACM
14 years 2 months ago
A Method for Finding Good Ashenhurst Decompositions and Its Application to FPGA Synthesis
—In this paper, we present an algorithm for finding a good Ashenhurst decomposition of a switching function. Most current methods for performing this type of decomposition are ba...
Ted Stanion, Carl Sechen
DSVIS
1995
Springer
14 years 2 months ago
On the Expression of Interaction Properties within an Interactor Model
This paper introduces a formal model for the description of interactive systems based on the interactor model of [15, 17]. Similarly to that model, it is intended to be used constr...
Panos Markopoulos