Sciweavers

2430 search results - page 70 / 486
» Computing Tutte Polynomials
Sort
View
113
Voted
CSR
2008
Springer
15 years 4 months ago
Comparing Universal Covers in Polynomial Time
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
Jirí Fiala, Daniël Paulusma
CONCUR
2008
Springer
15 years 4 months ago
Modeling Computational Security in Long-Lived Systems
Abstract. For many cryptographic protocols, security relies on the assumption that adversarial entities have limited computational power. This type of security degrades progressive...
Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nan...
SMA
2008
ACM
154views Solid Modeling» more  SMA 2008»
15 years 2 months ago
Consistent computation of first- and second-order differential quantities for surface meshes
Differential quantities, including normals, curvatures, principal directions, and associated matrices, play a fundamental role in geometric processing and physics-based modeling. ...
Xiangmin Jiao, Hongyuan Zha
CVPR
1998
IEEE
16 years 3 months ago
A New Complex Basis for Implicit Polynomial Curves and its Simple Exploitation for Pose Estimation and Invariant Recognition
New representations are developed for 2D IP (implicit polynomial) curves ofarbitrary degree. These representations permit shape recognition and pose estimation with essentially sin...
David B. Cooper, Jean-Philippe Tarel
127
Voted
ARITH
2005
IEEE
15 years 8 months ago
Arithmetic Operations in the Polynomial Modular Number System
We propose a new number representation and arithmetic for the elements of the ring of integers modulo p. The socalled Polynomial Modular Number System (PMNS) allows for fast polyn...
Jean-Claude Bajard, Laurent Imbert, Thomas Plantar...