Sciweavers

3557 search results - page 311 / 712
» Authoring Presentation for OpenMath
Sort
View
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
15 years 8 months ago
Improved bounds on the sample complexity of learning
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
Yi Li, Philip M. Long, Aravind Srinivasan
SOSP
1997
ACM
15 years 8 months ago
A Decentralized Model for Information Flow Control
This paper presents a new model for controlling information flow in systems with mutual distrust and decentralized authority. The model allows users to share information with dis...
Andrew C. Myers, Barbara Liskov
WSC
1996
15 years 8 months ago
Scalable simulation models for construction operations
Construction operations are often repetitive not only in terms of time (the same tasks are performed over and over) but also in terms of space (the same tasks are repeated at seve...
Photios G. Ioannou, Julio C. Martínez
IJCAI
1989
15 years 7 months ago
Negative Reasoning Using Inheritance
This paper presents methods of default reasoning which allow us to draw negative conclusions that are not available in some of the models for inheritance reasoning. Some of these ...
Lin Padgham
WEWORC
2007
129views Cryptology» more  WEWORC 2007»
15 years 7 months ago
Cryptanalysis of Achterbahn-128/80 with a New Keystream Limitation
This paper presents two key-recovery attacks against the last modication to Achterbahn-128/80 proposed by the authors at SASC 2007 due to the previous attacks. The 80-bit variant,...
María Naya-Plasencia