Sciweavers

1199 search results - page 113 / 240
» Parameterized Proof Complexity
Sort
View
TOG
2002
212views more  TOG 2002»
13 years 9 months ago
Least squares conformal maps for automatic texture atlas generation
A Texture Atlas is an efficient color representation for 3D Paint Systems. The model to be textured is decomposed into charts homeomorphic to discs, each chart is parameterized, a...
Bruno Lévy, Sylvain Petitjean, Nicolas Ray,...
ACMSE
2006
ACM
14 years 1 months ago
Revisiting a limit on efficient quantum computation
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
Tarsem S. Purewal Jr.
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 7 months ago
Property Testing via Set-Theoretic Operations
: Given two testable properties P1 and P2, under what conditions are the union, intersection or set-difference of these two properties also testable? We initiate a systematic study...
Victor Chen, Madhu Sudan, Ning Xie
CSFW
2006
IEEE
14 years 4 months ago
Cryptographically Sound Theorem Proving
We describe a faithful embedding of the Dolev-Yao model of Backes, Pfitzmann, and Waidner (CCS 2003) in the theorem prover Isabelle/HOL. This model is cryptographically sound in ...
Christoph Sprenger, Michael Backes, David A. Basin...
FM
2008
Springer
77views Formal Methods» more  FM 2008»
13 years 11 months ago
A Rigorous Approach to Networking: TCP, from Implementation to Protocol to Service
Abstract. Despite more then 30 years of research on protocol specification, the major protocols deployed in the Internet, such as TCP, are described only in informal prose RFCs and...
Tom Ridge, Michael Norrish, Peter Sewell