Sciweavers

195 search results - page 18 / 39
» Matrix-based Constructive Theorem Proving
Sort
View
CORR
2012
Springer
232views Education» more  CORR 2012»
12 years 2 months ago
A Formal Comparison of Approaches to Datatype-Generic Programming
-generic programming increases program abstraction and reuse by making functions operate uniformly across different types. Many approaches to generic programming have been proposed...
José Pedro Magalhães, Andres Lö...
ECCC
2006
134views more  ECCC 2006»
13 years 6 months ago
Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications
Ahlswede and Winter [AW02] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random...
Avi Wigderson, David Xiao
CDC
2010
IEEE
118views Control Systems» more  CDC 2010»
13 years 1 months ago
Explicit solutions for root optimization of a polynomial family
Abstract-- Given a family of real or complex monic polynomials of fixed degree with one fixed affine constraint on their coefficients, consider the problem of minimizing the root r...
Vincent D. Blondel, Mert Gurbuzbalaban, Alexandre ...
AIMSA
1998
Springer
13 years 11 months ago
A Blackboard Architecture for Guiding Interactive Proofs
The acceptance and usability of current interactive theorem proving environments is, among other things, strongly influenced by the availability of an intelligent default suggestio...
Christoph Benzmüller, Volker Sorge
FSE
2010
Springer
149views Cryptology» more  FSE 2010»
13 years 11 months ago
Domain Extension for Enhanced Target Collision-Resistant Hash Functions
We answer the question of Reyhanitabar et al. from FSE’09 of constructing a domain extension scheme for enhanced target collisionresistant (eTCR) hash functions with sublinear ke...
Ilya Mironov