Sciweavers

490 search results - page 30 / 98
» Equivalent Keys of HPC
Sort
View
AAECC
2009
Springer
142views Algorithms» more  AAECC 2009»
14 years 21 days ago
New Commutative Semifields and Their Nuclei
Abstract. Commutative semifields in odd characteristic can be equivalently described by planar functions (also known as PN functions). We describe a method to construct a semifield...
Jürgen Bierbrauer
PLILP
1994
Springer
14 years 5 days ago
Deriving Residual Reference Count Garbage Collectors
We present a strategy to derive an efficient reference count garbage collector for any applicative program by only modifying it on the source code level. The key to the approach is...
Wolfram Schulte
DGO
2003
118views Education» more  DGO 2003»
13 years 10 months ago
Enabling Email Confidentiality through the use of Opportunistic Encryption
Software for encrypting email messages has been widely available for more than 15 years, but the emailusing public has failed to adopt secure messaging. This failure can be explai...
Simson L. Garfinkel
DLT
2010
13 years 8 months ago
Minimization of Deterministic Bottom-Up Tree Transducers
We show that for every deterministic bottom-up tree transducer, a unique equivalent transducer can be constructed which is minimal. The construction is based on a sequence of norma...
Sylvia Friese, Helmut Seidl, Sebastian Maneth
IANDC
2008
116views more  IANDC 2008»
13 years 8 months ago
Deciding expressive description logics in the framework of resolution
We present a decision procedure for the description logic SHIQ based on the basic superposition calculus, and show that it runs in exponential time for unary coding of numbers. To...
Ullrich Hustadt, Boris Motik, Ulrike Sattler