Sciweavers

154 search results - page 27 / 31
» Using Proofs by Coinduction to Find
Sort
View
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
13 years 8 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
BMCBI
2008
111views more  BMCBI 2008»
13 years 7 months ago
SciDBMaker: new software for computer-aided design of specialized biological databases
Background: The exponential growth of research in molecular biology has brought concomitant proliferation of databases for stocking its findings. A variety of protein sequence dat...
Riadh Hammami, Abdelmajid Zouhir, Karim Naghmouchi...
EUROCRYPT
2009
Springer
14 years 7 months ago
Smashing SQUASH-0
At the RFID Security Workshop 2007, Adi Shamir presented a new challenge-response protocol well suited for RFIDs, although based on the Rabin public-key cryptosystem. This protocol...
Khaled Ouafi, Serge Vaudenay
ICMCS
1999
IEEE
118views Multimedia» more  ICMCS 1999»
13 years 11 months ago
Evaluation of Copyright Marking Systems
Hidden copyright marks have been proposed as a solution for solving the illegal copying and proof of ownership problems in the context of multimedia objects. Many systems have been...
Fabien A. P. Petitcolas, Ross J. Anderson
HASKELL
2007
ACM
13 years 11 months ago
A type-preserving closure conversion in haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By type-checking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier