Sciweavers

82 search results - page 16 / 17
» Position statement
Sort
View
DRM
2003
Springer
14 years 23 days ago
Breaking and repairing optimistic fair exchange from PODC 2003
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures. We show that their protocol is totally breakable already...
Yevgeniy Dodis, Leonid Reyzin
JCDL
2010
ACM
163views Education» more  JCDL 2010»
14 years 19 days ago
Flexible access to photo libraries via time, place, tags, and visual features
Photo libraries are growing in quantity and size, requiring better support for locating desired photographs. MediaGLOW is an interactive visual workspace designed to address this ...
Andreas Girgensohn, Frank Shipman, Thea Turner, Ly...
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
13 years 11 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
ECOOP
2004
Springer
13 years 11 months ago
A Reflective Approach to Dynamic Software Evolution
In this paper, we present a solution that allows systems to remain active while they are evolving. Our approach goes out from the principle of separated concerns and has two steps....
Peter Ebraert, Tom Tourwé
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 7 months ago
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted ...
Bernard Boigelot, Julien Brusten, Véronique...