989 search results - page 7 / 198 » Pebbling and Proofs of Work |
CHI
2003
ACM
14 years 9 months ago
2003
ACM
People with motor impairments often cannot use a keyboard or a mouse. Our previous work showed that a handheld device, connected to a PC, could be effective for computer access fo...
JMM2
2007
13 years 9 months ago
2007
— In this paper, the use of active illumination is extended to image segmentation, specifically in the case of overlapping particles. This work is based on Multi-Flash Imaging (M...
LPAR
2012
Springer
12 years 4 months ago
2012
Springer
E-matching is the most commonly used technique to handle quantifiers in SMT solvers. It works by identifying characteristic subexpressions of quantified formulae, named triggers,...
CSL
1999
Springer
13 years 8 months ago
1999
Springer
We explain why the original proofs of P-Time completeness for Light Affine Logic and Light Linear Logic can not work, and we fully develop a working one.
LFCS
2009
Springer
14 years 3 months ago
2009
Springer
This work defines an extension CERES2 of the first-order cut-elimination method CERES to the subclass of sequent calculus proofs in second-order logic using quantifier-free comp...