Sciweavers

7796 search results - page 75 / 1560
» On Generalized Schur Numbers
Sort
View
ILP
2005
Springer
15 years 10 months ago
A Framework for Set-Oriented Computation in Inductive Logic Programming and Its Application in Generalizing Inverse Entailment
We propose a new approach to Inductive Logic Programming that systematically exploits caching and offers a number of advantages over current systems. It avoids redundant computati...
Héctor Corrada Bravo, David Page, Raghu Ram...
ISCIS
2005
Springer
15 years 10 months ago
Generalizing Redundancy Elimination in Checking Sequences
Abstract. Based on a distinguishing sequence for a Finite State Machine (FSM), an efficient checking sequence may be produced from the elements of a set Eα of α –sequences and ...
K. Tuncay Tekle, Hasan Ural, M. Cihan Yalcin, H&uu...
TCC
2004
Springer
118views Cryptology» more  TCC 2004»
15 years 9 months ago
A General Composition Theorem for Secure Reactive Systems
Abstract. We consider compositional properties of reactive systems that are secure in a cryptographic sense. We follow the well-known simulatability approach of modern cryptography...
Michael Backes, Birgit Pfitzmann, Michael Waidner
ACSAC
2000
IEEE
15 years 8 months ago
A Reliable, Scalable General-Purpose Certificate Store
Although there have been various proposals to build large-scale PKIs, there appears to be no research publicly available on the underlying certificate store which will be required...
Peter Gutmann
COMPGEOM
2007
ACM
15 years 8 months ago
Bi-criteria linear-time approximations for generalized k-mean/median/center
We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...
Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev