Sciweavers

1404 search results - page 257 / 281
» Complexity of admissible rules
Sort
View
IWANN
2005
Springer
14 years 2 months ago
Characterizing Self-developing Biological Neural Networks: A First Step Towards Their Application to Computing Systems
Carbon nanotubes are often seen as the only alternative technology to silicon transistors. While they are the most likely short-term alternative, other longer-term alternatives sho...
Hugues Berry, Olivier Temam
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
14 years 2 months ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky
LPNMR
1997
Springer
14 years 23 days ago
Power Defaults
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...
Guo-Qiang Zhang, William C. Rounds
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
14 years 15 days ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...
FOCS
2004
IEEE
14 years 10 days ago
Shuffling by Semi-Random Transpositions
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
Elchanan Mossel, Yuval Peres, Alistair Sinclair