Sciweavers

429 search results - page 22 / 86
» Permutative Additives and Exponentials
Sort
View
TCS
2011
13 years 2 months ago
Correctness of linear logic proof structures is NL-complete
We provide new correctness criteria for all fragments (multiplicative, exponential, additive) of linear logic. We use these criteria for proving that deciding the correctness of a...
Paulin Jacobé de Naurois, Virgile Mogbil
BMCBI
2007
148views more  BMCBI 2007»
13 years 7 months ago
Computation of significance scores of unweighted Gene Set Enrichment Analyses
Background: Gene Set Enrichment Analysis (GSEA) is a computational method for the statistical evaluation of sorted lists of genes or proteins. Originally GSEA was developed for in...
Andreas Keller, Christina Backes, Hans-Peter Lenho...
VMCAI
2010
Springer
14 years 5 months ago
Complexity Bounds for the Verification of Real-Time Software
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...
Rohit Chadha, Axel Legay, Pavithra Prabhakar, Mahe...
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 5 months ago
Least Squares Superposition Codes of Moderate Dictionary Size, Reliable at Rates up to Capacity
Sparse superposition codes are developed for the additive white Gaussian noise channel with average codeword power constraint. Codewords are linear combinations of subsets of vecto...
Andrew R. Barron, Antony Joseph
COLT
2001
Springer
14 years 7 days ago
Learning Rates for Q-Learning
In this paper we derive convergence rates for Q-learning. We show an interesting relationship between the convergence rate and the learning rate used in Q-learning. For a polynomi...
Eyal Even-Dar, Yishay Mansour