Sciweavers

1199 search results - page 46 / 240
» Parameterized Proof Complexity
Sort
View
CRYPTO
2000
Springer
182views Cryptology» more  CRYPTO 2000»
14 years 1 months ago
A Note on the Round-Complexity of Concurrent Zero-Knowledge
Abstract. We present a lower bound on the number of rounds required by Concurrent Zero-Knowledge proofs for languages in NP. It is shown that in the context of Concurrent Zero-Know...
Alon Rosen
SACMAT
2009
ACM
14 years 3 months ago
Symbolic reachability analysis for parameterized administrative role based access control
Role based access control (RBAC) is a widely used access control paradigm. In large organizations, the RBAC policy is managed by multiple administrators. An administrative role ba...
Scott D. Stoller, Ping Yang, Mikhail I. Gofman, C....
IMR
2003
Springer
14 years 1 months ago
An Adaptable Surface Parameterization Method
Parameterizations of triangulated surfaces are used in an increasing number of mesh processing applications for various purposes. Although demands vary, they are often required to...
Patrick Degener, Jan Meseth, Reinhard Klein
RECOMB
2006
Springer
14 years 9 months ago
A Parameterized Algorithm for Protein Structure Alignment
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
Jinbo Xu, Feng Jiao, Bonnie Berger
CGF
2011
13 years 8 days ago
Walking On Broken Mesh: Defect-Tolerant Geodesic Distances and Parameterizations
Efficient methods to compute intrinsic distances and geodesic paths have been presented for various types of surface representations, most importantly polygon meshes. These meshe...
Marcel Campen, Leif Kobbelt