Sciweavers

680 search results - page 34 / 136
» Complexity of Strict Implication
Sort
View
EUROCRYPT
2010
Springer
14 years 14 days ago
Adaptive Trapdoor Functions and Chosen-Ciphertext Security
We introduce the notion of adaptive trapdoor functions (ATDFs); roughly, ATDFs remain one-way even when the adversary is given access to an inversion oracle. Our main application ...
Eike Kiltz, Payman Mohassel, Adam O'Neill
COLING
1996
13 years 9 months ago
The Power of Words in Message Planning
Abstract: Before engaging in a conversation, a message must be planned. While there are many ways to perform this task, I believe that people do this in the following way, in parti...
Michael Zock
ISSEP
2010
Springer
243views Education» more  ISSEP 2010»
14 years 4 months ago
Object-Oriented Modeling of Object-Oriented Concepts
Teaching introductory object-oriented programming presents considerable challenges. Some of these challenges are due to the intrinsic complexity of the subject matter — object-or...
Michela Pedroni, Bertrand Meyer
ISCAS
2007
IEEE
92views Hardware» more  ISCAS 2007»
14 years 1 months ago
Multifunctional RF Transmitters for Next Generation Wireless Transceivers
: Future generations of wireless communications are expected to place increasing burdens on the efficiency and linearity of power amplifiers, due to the use of more complex wavefor...
Lawrence Larson, Peter Asbeck, Donald Kimball
COMPGEOM
2004
ACM
14 years 1 months ago
The geometric thickness of low degree graphs
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...
Christian A. Duncan, David Eppstein, Stephen G. Ko...