Sciweavers

1795 search results - page 217 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
ISCI
2008
160views more  ISCI 2008»
13 years 10 months ago
Certificateless undeniable signature scheme
In this paper, we present the first certificateless undeniable signature scheme. The scheme does not suffer from the key escrow problem, which is inherent in identity based crypto...
Shanshan Duan
CSI
2007
91views more  CSI 2007»
13 years 10 months ago
Implementing regular cash with blind fixed-value electronic coins
We propose a generic framework for the development of an off-line peer-to-peer electronic payment system with fixed-value electronic coins. The proposed scheme simulates the issua...
Dimitrios Lekkas, Diomidis Spinellis
JAR
2006
106views more  JAR 2006»
13 years 10 months ago
Some Computational Aspects of distance-sat
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
Olivier Bailleux, Pierre Marquis
DCG
2007
58views more  DCG 2007»
13 years 10 months ago
Harmonic Algebraic Curves and Noncrossing Partitions
Motivated by Gauss’s first proof of the Fundamental Theorem of Algebra, we study the topology of harmonic algebraic curves. By the maximum principle, a harmonic curve has no bou...
Jeremy L. Martin, David Savitt, Ted Singer
JMIV
2006
94views more  JMIV 2006»
13 years 10 months ago
Geodesic Shooting for Computational Anatomy
Studying large deformations with a Riemannian approach has been an efficient point of view to generate metrics between deformable objects, and to provide accurate, non ambiguous an...
Michael I. Miller, Alain Trouvé, Laurent Yo...