Sciweavers

4940 search results - page 34 / 988
» On the Complexity of Universal Programs
Sort
View
ICISC
2008
126views Cryptology» more  ICISC 2008»
15 years 3 months ago
Essentially Optimal Universally Composable Oblivious Transfer
Oblivious transfer is one of the most important cryptographic primitives, both for theoretical and practical reasons and several protocols were proposed during the years. We provid...
Ivan Damgård, Jesper Buus Nielsen, Claudio O...
ICIP
2002
IEEE
16 years 3 months ago
Efficient and universal scalable video coding
This paper proposes a unified efficient and universal scalable video coding framework that supports different scalabilities, such as fine granularity quality, temporal, spatial an...
Feng Wu, Shipeng Li, Rong Yan, Xiaoyan Sun, Ya-Qin...
ISESE
2003
IEEE
15 years 7 months ago
Building Pair Programming Knowledge through a Family of Experiments
Pair programming is a practice in which two programmers work collaboratively at one computer on the same design, algorithm, code, or test. Pair programming is becoming increasingl...
Laurie A. Williams, Charlie McDowell, Nachiappan N...
JAIR
2000
96views more  JAIR 2000»
15 years 1 months ago
OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains
Recently model checking representation and search techniques were shown to be efciently applicable to planning, in particular to non-deterministic planning. Such planning approach...
Rune M. Jensen, Manuela M. Veloso
DAGSTUHL
1996
15 years 3 months ago
A Uniform Approach for Compile-Time and Run-Time Specialization
As partial evaluation gets more mature, it is now possible to use this program transformation technique to tackle realistic languages and real-size application programs. However, t...
Charles Consel, Luke Hornof, François No&eu...