Sciweavers

4438 search results - page 560 / 888
» The Case for Collaborative Programming
Sort
View
ICALP
2005
Springer
16 years 7 days ago
Completely Non-malleable Schemes
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
Marc Fischlin
TARK
2005
Springer
16 years 6 days ago
First-order classical modal logic: applications in logics of knowledge and probability
The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighb...
Horacio L. Arló-Costa, Eric Pacuit
CASES
2004
ACM
16 years 4 days ago
A post-compiler approach to scratchpad mapping of code
ScratchPad Memories (SPMs) are commonly used in embedded systems because they are more energy-efficient than caches and enable tighter application control on the memory hierarchy...
Federico Angiolini, Francesco Menichelli, Alberto ...
CP
2004
Springer
16 years 3 days ago
Constraint Propagation as a Proof System
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
Albert Atserias, Phokion G. Kolaitis, Moshe Y. Var...
ESTIMEDIA
2004
Springer
16 years 3 days ago
Identifying "representative" workloads in designing MpSoC platforms for media processing
— Workload design is a well recognized problem in the domain of microprocessor design. Different program characteristics that influence the selection of a representative workloa...
Alexander Maxiaguine, Samarjit Chakraborty, Wei Ts...