Sciweavers

534 search results - page 57 / 107
» One more bit is enough
Sort
View
CSL
2001
Springer
14 years 16 days ago
A Logic for Approximate First-Order Reasoning
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ï...
Frédéric Koriche
ECSQARU
2007
Springer
13 years 12 months ago
Conflict Analysis and Merging Operators Selection in Possibility Theory
In possibility theory, the degree of inconsistency is commonly used to measure the level of conflict in information from multiple sources after merging, especially conjunctive merg...
Weiru Liu
CTRSA
2006
Springer
183views Cryptology» more  CTRSA 2006»
13 years 11 months ago
Efficient Doubling on Genus 3 Curves over Binary Fields
The most important and expensive operation in a hyperelliptic curve cryptosystem (HECC) is scalar multiplication by an integer k, i.e., computing an integer k times a divisor D on ...
Xinxin Fan, Thomas J. Wollinger, Yumin Wang
RTA
1995
Springer
13 years 11 months ago
Completion for Multiple Reduction Orderings
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
Masahito Kurihara, Hisashi Kondo, Azuma Ohuchi
ASIACRYPT
2008
Springer
13 years 10 months ago
Limits of Constructive Security Proofs
The collision-resistance of hash functions is an important foundation of many cryptographic protocols. Formally, collision-resistance can only be expected if the hash function in f...
Michael Backes, Dominique Unruh