Sciweavers

4850 search results - page 272 / 970
» Proof and Computation in Geometry
Sort
View
CGF
2002
127views more  CGF 2002»
15 years 6 months ago
Projective Texture Mapping with Full Panorama
Projective texture mapping is used to project a texture map onto scene geometry. It has been used in many applications, since it eliminates the assignment of fixed texture coordin...
Dongho Kim, James K. Hahn
IPPS
2003
IEEE
15 years 12 months ago
A UNITY-Based Formalism for Dynamic Distributed Systems
We describe Dynamic UNITY, a new formalism for the specification of dynamic distributed systems based on the UNITY formalism. This formalism allows for the specification and pro...
Daniel M. Zimmerman
192
Voted
CIE
2010
Springer
15 years 11 months ago
Circuit Complexity and Multiplicative Complexity of Boolean Functions
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...
Arist Kojevnikov, Alexander S. Kulikov
RTA
2010
Springer
15 years 10 months ago
Modular Complexity Analysis via Relative Complexity
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
Harald Zankl, Martin Korp
RTA
2005
Springer
16 years 4 days ago
Arithmetic as a Theory Modulo
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
Gilles Dowek, Benjamin Werner