Sciweavers

238 search results - page 39 / 48
» On the Modularity of Theories
Sort
View
FDTC
2006
Springer
80views Cryptology» more  FDTC 2006»
13 years 11 months ago
Robust Finite Field Arithmetic for Fault-Tolerant Public-Key Cryptography
We present a new approach to fault tolerant public key cryptography based on redundant arithmetic in finite rings. Redundancy is achieved by embedding non-redundant field or ring ...
Gunnar Gaubatz, Berk Sunar
FOIKS
2008
Springer
13 years 9 months ago
Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
Martin Gebser, Torsten Schaub, Hans Tompits, Stefa...
LREC
2008
117views Education» more  LREC 2008»
13 years 9 months ago
Chooser: a Multi-Task Annotation Tool
The paper presents a tool assisting manual annotation of linguistic data developed at the Department of Computational linguistics, IBL-BAS. Chooser is a general-purpose modular ap...
Svetla Koeva, Borislav Rizov, Svetlozara Leseva
NIPS
2000
13 years 9 months ago
Adaptive Object Representation with Hierarchically-Distributed Memory Sites
Theories of object recognition often assume that only one representation scheme is used within one visual-processing pathway. Versatility of the visual system comes from having mu...
Bosco S. Tjan
ICFP
2010
ACM
13 years 8 months ago
Polyvariant flow analysis with higher-ranked polymorphic types and higher-order effect operators
We present a type and effect system for flow analysis that makes essential use of higher-ranked polymorphism. We show that, for higher-order functions, the expressiveness of highe...
Stefan Holdermans, Jurriaan Hage