Sciweavers

989 search results - page 115 / 198
» Pebbling and Proofs of Work
Sort
View
PLILP
1992
Springer
14 years 4 days ago
Unfold/fold Transformations Preserving Termination Properties
The unfold/fold framework constitutes the spine of many program transformation strategies. However, by unrestricted use of folding the target program may terminate less often than...
Torben Amtoft
ITP
2010
114views Mathematics» more  ITP 2010»
13 years 12 months ago
A New Foundation for Nominal Isabelle
Pitts et al introduced a beautiful theory about names and binding based on the notions of permutation and support. The engineering challenge is to smoothly adapt this theory to a t...
Brian Huffman, Christian Urban
ADC
2004
Springer
141views Database» more  ADC 2004»
13 years 12 months ago
Conflict Scheduling of Transactions on XML Documents
In the last few years an interest in native XML databases has surfaced. With other authors we argue that such databases need their own provisions for concurrency control since tra...
Stijn Dekeyser, Jan Hidders
NIPS
2007
13 years 9 months ago
Invariant Common Spatial Patterns: Alleviating Nonstationarities in Brain-Computer Interfacing
Brain-Computer Interfaces can suffer from a large variance of the subject conditions within and across sessions. For example vigilance fluctuations in the individual, variable ta...
Benjamin Blankertz, Motoaki Kawanabe, Ryota Tomiok...
APAL
2010
114views more  APAL 2010»
13 years 8 months ago
Classical predicative logic-enriched type theories
A logic-enriched type theory (LTT) is a type theory extended with a primitive mechanism for forming and proving propositions. We construct two LTTs, named LTT0 and LTT 0, which we...
Robin Adams, Zhaohui Luo