Sciweavers

11345 search results - page 2033 / 2269
» Foundations of Computer Science
Sort
View
108
Voted
SOFSEM
2009
Springer
15 years 7 months ago
Partial Order Semantics of Types of Nets
In this paper we define partial order semantics of types of nets. Types of nets are a parametric definition of Petri nets originally developed for a general presentation of the s...
Robert Lorenz, Gabriel Juhás, Sebastian Mau...
PODS
2000
ACM
146views Database» more  PODS 2000»
15 years 7 months ago
Analysis and Application of Adaptive Sampling
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
James F. Lynch
ASIACRYPT
2000
Springer
15 years 7 months ago
A New Forward-Secure Digital Signature Scheme
nded abstract of this work appears Advances in Cryptology — Asiacrypt 2000, Tatsuaki Okamoto, editor, Lecture Notes in Computer Science vol. 1976, Springer-Verlag, 2000. c IACR A...
Michel Abdalla, Leonid Reyzin
ACISP
1999
Springer
15 years 7 months ago
Changing Thresholds in the Absence of Secure Channels
The ways the threshold parameter can be modified after the setup of a secret sharing scheme is the main theme of this work. The considerations are limited to the case when there ...
Keith M. Martin, Josef Pieprzyk, Reihaneh Safavi-N...
COMPULOG
1999
Springer
15 years 7 months ago
Dynamic Constraint Models for Planning and Scheduling Problems
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...
Roman Barták
« Prev « First page 2033 / 2269 Last » Next »