Sciweavers

3305 search results - page 225 / 661
» Can we Rely on SQL
Sort
View
TCS
2008
15 years 6 months ago
A simple transitive signature scheme for directed trees
Transitive signatures allow a signer to authenticate edges in a graph in such a way that anyone, given the public key and two signatures on adjacent edges (i, j) and (j, k), can c...
Gregory Neven
TCS
2008
15 years 6 months ago
The weak lambda calculus as a reasonable machine
We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value la...
Ugo Dal Lago, Simone Martini
AC
2004
Springer
15 years 6 months ago
Shotgun Sequence Assembly
Shotgun sequencing is the most widely used technique for determining the DNA sequence of organisms. It involves breaking up the DNA into many small pieces that can be read by auto...
Mihai Pop
JUCS
2007
106views more  JUCS 2007»
15 years 6 months ago
An Ontology-based Approach to Support Text Mining and Information Retrieval in the Biological Domain
: This paper describes an ontology-based approach aiming at helping biologists to annotate their documents and at facilitating their information retrieval task. Our approach, based...
Khaled Khelif, Rose Dieng-Kuntz, Pascal Barbry
FAC
1998
111views more  FAC 1998»
15 years 6 months ago
A Formal Axiomatization for Alphabet Reasoning with Parametrized Processes
In the process-algebraic veri cation of systems with three or more components put in parallel, alphabet axioms are considered to be very useful. These are rules that exploit the i...
Henri Korver, M. P. A. Sellink