Sciweavers

CORR
2004
Springer
123views Education» more  CORR 2004»
13 years 4 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui
CORR
2004
Springer
56views Education» more  CORR 2004»
13 years 4 months ago
Examples of Models of the Asynchronous Circuits
The notion of limit condition that we propose is a generalization of the delay condition [1], [2], including the models of the delay circuits, of the C elements of Muller and of t...
Serban E. Vlad
CORR
2004
Springer
89views Education» more  CORR 2004»
13 years 4 months ago
On the Inertia of the Asynchronous Circuits
By making use of the notions and the notations from [12], we present the bounded delays, the absolute inertia and the relative inertia. 1 Bounded Delays
Serban E. Vlad
CORR
2004
Springer
82views Education» more  CORR 2004»
13 years 4 months ago
Towards a Mathematical Theory of the Delays of the Asynchronous Circuits
The inequations of the delays of the asynchronous circuits are written, by making use of pseudo-Boolean differential calculus. We consider these efforts to be a possible starting p...
Serban E. Vlad
CORR
2004
Springer
107views Education» more  CORR 2004»
13 years 4 months ago
Encapsulation for Practical Simplification Procedures
ACL2 was used to prove properties of two simplification procedures. The procedures differ in complexity but solve the same programming problem that arises in the context of a reso...
Olga Shumsky Matlin, William McCune
CORR
2004
Springer
88views Education» more  CORR 2004»
13 years 4 months ago
A Note on the PAC Bayesian Theorem
We prove general exponential moment inequalities for averages of [0,1]valued iid random variables and use them to tighten the PAC Bayesian Theorem. The logarithmic dependence on t...
Andreas Maurer
CORR
2004
Springer
152views Education» more  CORR 2004»
13 years 4 months ago
Non-negative matrix factorization with sparseness constraints
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...
Patrik O. Hoyer
CORR
2004
Springer
103views Education» more  CORR 2004»
13 years 4 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...
CORR
2004
Springer
92views Education» more  CORR 2004»
13 years 4 months ago
Tournament versus Fitness Uniform Selection
1 In evolutionary algorithms a critical parameter that must be tuned is that of selection pressure. If it is set too low then the rate of convergence towards the optimum is likely...
Shane Legg, Marcus Hutter, Akshat Kumar
CORR
2004
Springer
140views Education» more  CORR 2004»
13 years 4 months ago
Capacity Analysis for Continuous Alphabet Channels with Side Information, Part II: MIMO Channels
In this part, we consider the capacity analysis for wireless mobile systems with multiple antenna architectures. We apply the results of the first part to a commonly known baseban...
Majid Fozunbal, Steven W. McLaughlin, Ronald W. Sc...