Sciweavers

989 search results - page 2 / 198
» Pebbling and Proofs of Work
Sort
View
CRYPTO
2011
Springer
222views Cryptology» more  CRYPTO 2011»
12 years 5 months ago
Computer-Aided Security Proofs for the Working Cryptographer
Abstract. We present EasyCrypt, an automated tool for elaborating security proofs of cryptographic systems from proof sketches—compact, formal representations of the essence of a...
Gilles Barthe, Benjamin Grégoire, Sylvain H...
JALC
2007
79views more  JALC 2007»
13 years 5 months ago
Two-Way Finite Automata with a Write-Once Track
The basic finite automata model has been extended over the years with different acceptance modes (nondeterminism, alternation), new or improved devices (two-way heads, pebbles, ...
Berke Durak
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
14 years 5 months ago
Narrow proofs may be spacious: separating space and width in resolution
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
Jakob Nordström
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 5 months ago
Pebbling and Branching Programs Solving the Tree Evaluation Problem
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
Dustin Wehr
ESANN
2008
13 years 6 months ago
On related violating pairs for working set selection in SMO algorithms
Sequential Minimal Optimization (SMO) is currently the most popular algorithm to solve large quadratic programs for Support Vector Machine (SVM) training. For many variants of this...
Tobias Glasmachers