930 search results - page 95 / 186 » A Universal Encryption Standard |
CIE
2005
Springer
14 years 3 months ago
2005
Springer
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The general...
CC
2004
Springer
14 years 3 months ago
2004
Springer
We present an algorithm for counting the number of integer solutions to selected free variables of a Presburger formula. We represent the Presburger formula as a deterministic fin...
3DIM
2003
IEEE
14 years 3 months ago
2003
IEEE
This paper summarizes a series of recent research results made at Edinburgh University based applying domain knowledge of standard shapes and relationships to solve or improve arc...
WWW
2003
ACM
14 years 3 months ago
2003
ACM
This paper addresses interoperability issues of learning content management systems. Motivation and design challenges are presented and an interoperability framework implemented a...
GMP
2002
IEEE
14 years 3 months ago
2002
IEEE
This paper summarizes a series of recent research results made at Edinburgh University based on projects that apply domain knowledge of standard shapes and relationships to solve ...