Sciweavers

380 search results - page 35 / 76
» A Categorical Setting for Lower Complexity
Sort
View
ASIACRYPT
2009
Springer
15 years 4 months ago
Security Bounds for the Design of Code-Based Cryptosystems
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has th...
Matthieu Finiasz, Nicolas Sendrier
CDC
2009
IEEE
15 years 2 months ago
Schur-based decomposition for reachability analysis of linear time-invariant systems
— We present a method for complexity reduction in reachability analysis and controller synthesis via a Schur-based decomposition for LTI systems. The decomposition yields either ...
Shahab Kaynama, Meeko Oishi
98
Voted
SPAA
2009
ACM
15 years 6 months ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...
IANDC
2006
102views more  IANDC 2006»
14 years 9 months ago
Polynomial certificates for propositional classes
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
Marta Arias, Aaron Feigelson, Roni Khardon, Rocco ...
ICIP
2004
IEEE
15 years 11 months ago
Learning structured dictionaries for image representation
The dictionary approach to signal and image processing has been massively investigated in the last two decades, proving very attractive for a wide range of applications. The effec...
Gianluca Monaci, Pierre Vandergheynst