Sciweavers

151 search results - page 16 / 31
» Optimal Acceptors and Optimal Proof Systems
Sort
View
MLDM
1999
Springer
14 years 1 months ago
Automatic Design of Multiple Classifier Systems by Unsupervised Learning
In the field of pattern recognition, multiple classifier systems based on the combination of the outputs of a set of different classifiers have been proposed as a method for the de...
Giorgio Giacinto, Fabio Roli
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 8 months ago
A Type System for Data-Flow Integrity on Windows Vista
The Windows Vista operating system implements an interesting model of multi-level integrity. We observe that in this model, trusted code must participate in any information-flow a...
Avik Chaudhuri, Prasad Naldurg, Sriram K. Rajamani
LPAR
2010
Springer
13 years 6 months ago
Verifying Pointer and String Analyses with Region Type Systems
Pointer analysis statically approximates the heap pointer structure during a program execution in order to track heap objects or to establish alias relations between references, a...
Lennart Beringer, Robert Grabowski, Martin Hofmann
WDAG
1993
Springer
98views Algorithms» more  WDAG 1993»
14 years 25 days ago
Fairness of N-party Synchronization and Its Implementation in a Distributed Environment
Fairness is an important concept in design and implementation of distributed systems. At the specification level, fairness usually serves as an assumption for proving liveness. At ...
Cheng Wu, Gregor von Bochmann, Ming Yu Yao
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 9 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur