Sciweavers

6050 search results - page 1067 / 1210
» Information In The Non-Stationary Case
Sort
View
CRYPTO
2000
Springer
134views Cryptology» more  CRYPTO 2000»
14 years 1 months ago
Taming the Adversary
Abstract. While there is a great deal of sophistication in modern cryptology, simple (and simplistic) explanations of cryptography remain useful and perhaps necessary. Many of the ...
Martín Abadi
IPPS
1999
IEEE
14 years 1 months ago
Process Networks as a High-Level Notation for Metacomputing
Abstract. Our work involves the development of a prototype Geographical Information System GIS as an example of the use of process networks as a well-de ned high-level semantic mod...
Darren Webb, Andrew L. Wendelborn, Kevin Maciunas
SSDBM
1999
IEEE
118views Database» more  SSDBM 1999»
14 years 1 months ago
Evaluation of Ad Hoc OLAP: In-Place Computation
Large scale data analysis and mining activities, such as identifying interesting trends, making unusual patterns to stand out and verifying hypotheses, require sophisticated infor...
Damianos Chatziantoniou
AC
1998
Springer
14 years 1 months ago
The Search for the Holy Grail in Quantum Cryptography
Abstract. In 1982, Bennett and Brassard suggested a new way to provide privacy in long distance communications with security based on the correctness of the basic principles of qua...
Louis Salvail
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
14 years 1 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
« Prev « First page 1067 / 1210 Last » Next »