Sciweavers

151 search results - page 21 / 31
» Optimal Acceptors and Optimal Proof Systems
Sort
View
POPL
2008
ACM
14 years 9 months ago
Engineering formal metatheory
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
Arthur Charguéraud, Benjamin C. Pierce, Bri...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 2 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
CRYPTO
2007
Springer
106views Cryptology» more  CRYPTO 2007»
14 years 21 days ago
Indistinguishability Amplification
system is the abstraction of the input-output behavior of any kind of discrete system, in particular cryptographic systems. Many aspects of cryptographic security analyses and pro...
Ueli M. Maurer, Krzysztof Pietrzak, Renato Renner
KDD
2005
ACM
117views Data Mining» more  KDD 2005»
14 years 9 months ago
Rule extraction from linear support vector machines
We describe an algorithm for converting linear support vector machines and any other arbitrary hyperplane-based linear classifiers into a set of non-overlapping rules that, unlike...
Glenn Fung, Sathyakama Sandilya, R. Bharat Rao
FDL
2008
IEEE
14 years 3 months ago
Model-based Design Space Exploration for RTES with SysML and MARTE
The features of the emerging modeling languages for system design allow designers to build models of almost any kind of heterogeneous hardware-software systems, including Real Tim...
Marcello Mura, Luis Gabriel Murillo, Mauro Prevost...