Sciweavers

8141 search results - page 1389 / 1629
» Higher Order Generalization
Sort
View
CRYPTO
2000
Springer
110views Cryptology» more  CRYPTO 2000»
15 years 8 months ago
Parallel Reducibility for Information-Theoretically Secure Computation
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
Yevgeniy Dodis, Silvio Micali
AGP
1998
IEEE
15 years 8 months ago
Dynamic Logic Programming
In this paper we investigate updates of knowledge bases represented by logic programs. In order to represent negative information, we use generalized logic programs which allow de...
José Júlio Alferes, João Alex...
CONCUR
1998
Springer
15 years 8 months ago
Algebraic Techniques for Timed Systems
Performance evaluation is a central issue in the design of complex real-time systems. In this work, we propose an extension of socalled "Max-Plus" algebraic techniques to...
Albert Benveniste, Claude Jard, Stephane Gaubert
KDD
1998
ACM
80views Data Mining» more  KDD 1998»
15 years 8 months ago
Human Performance on Clustering Web Pages: A Preliminary Study
With the increase in information on the World Wide Web it has become difficult to quickly find desired information without using multiple queries or using a topic-specific search ...
Sofus A. Macskassy, Arunava Banerjee, Brian D. Dav...
MFCS
1998
Springer
15 years 8 months ago
Facial Circuits of Planar Graphs and Context-Free Languages
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
Bruno Courcelle, Denis Lapoire
« Prev « First page 1389 / 1629 Last » Next »