Sciweavers

732 search results - page 58 / 147
» corr 2011
Sort
View
CORR
2011
Springer
191views Education» more  CORR 2011»
14 years 7 months ago
Computing Optimal Coverability Costs in Priced Timed Petri Nets
—We consider timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints...
Parosh Aziz Abdulla, Richard Mayr
CORR
2011
Springer
156views Education» more  CORR 2011»
14 years 10 months ago
Impossibility of Succinct Quantum Proofs for Collision-Freeness
We show that any quantum algorithm to decide whether a function f : [n] → [n] is a permutation or far from a permutation must make Ω n1/3 /w queries to f, even if the algorith...
Scott Aaronson
CORR
2011
Springer
152views Education» more  CORR 2011»
14 years 10 months ago
Sparsity Equivalence of Anisotropic Decompositions
Anisotropic decompositions using representation systems such as curvelets, contourlet, or shearlets have recently attracted significantly increased attention due to the fact that...
Gitta Kutyniok
CORR
2011
Springer
173views Education» more  CORR 2011»
14 years 10 months ago
Linear Dependent Types and Relative Completeness
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
Ugo Dal Lago, Marco Gaboardi
CORR
2011
Springer
148views Education» more  CORR 2011»
14 years 7 months ago
Repetitive Reduction Patterns in Lambda Calculus with letrec (Work in Progress)
extended abstract we report on work in progress carried out within the framework of the NWO project Realising Optimal Sharing. Instead of discussing optimal reduction in the λ-cal...
Jan Rochel, Clemens Grabmayer