Sciweavers

3145 search results - page 356 / 629
» Algebraic Linear Orderings
Sort
View
ASIACRYPT
2000
Springer
15 years 11 months ago
Improved Methods to Perform Threshold RSA
Abstract. A t out of n threshold scheme is such that shares are distributed to n participants so that any set of t participants can compute the secret, whereas any set of less than...
Brian King
ECAI
2000
Springer
15 years 11 months ago
Lazy Propositionalisation for Relational Learning
A number of Inductive Logic Programming (ILP) systems have addressed the problem of learning First Order Logic (FOL) discriminant definitions by first reformulating the FOL lear...
Érick Alphonse, Céline Rouveirol
STOC
1998
ACM
125views Algorithms» more  STOC 1998»
15 years 10 months ago
Spot-Checkers
On Labor Day weekend, the highway patrol sets up spot-checks at random points on the freeways with the intention of deterring a large fraction of motorists from driving incorrectl...
Funda Ergün, Sampath Kannan, Ravi Kumar, Roni...
MFCS
1997
Springer
15 years 10 months ago
Integrating the Specification Techniques of Graph Transformation and Temporal Logic
The aim of this paper is an integration of graph grammars with different kinds of behavioural constraints, in particular with temporal logic constraints. Since the usual algebraic ...
Reiko Heckel, Hartmut Ehrig, Uwe Wolter, Andrea Co...
ITC
1994
IEEE
151views Hardware» more  ITC 1994»
15 years 10 months ago
Automated Logic Synthesis of Random-Pattern-Testable Circuits
Previous approaches to designing random pattern testable circuits use post-synthesis test point insertion to eliminate random pattern resistant (r.p.r.) faults. The approach taken...
Nur A. Touba, Edward J. McCluskey