Sciweavers

2465 search results - page 126 / 493
» Automata on Linear Orderings
Sort
View
AUTOMATICA
2006
68views more  AUTOMATICA 2006»
13 years 9 months ago
State and unknown input estimation for linear discrete-time systems
: This paper deals with a new type of estimator for discrete-time linear systems with unknown inputs. A constructive algorithm is given in order to analyze the state observability ...
Thierry Floquet, Jean-Pierre Barbot
MOC
2000
83views more  MOC 2000»
13 years 9 months ago
On the problem of spurious eigenvalues in the approximation of linear elliptic problems in mixed form
In the approximation of linear elliptic operators in mixed form, it is well known that the so-called inf-sup and ellipticity in the kernel properties are sufficient (and, in a sens...
Daniele Boffi, Franco Brezzi, Lucia Gastaldi
CORR
2012
Springer
210views Education» more  CORR 2012»
12 years 4 months ago
Towards minimax policies for online linear optimization with bandit feedback
We address the online linear optimization problem with bandit feedback. Our contribution is twofold. First, we provide an algorithm (based on exponential weights) with a regret of...
Sébastien Bubeck, Nicolò Cesa-Bianch...
ALGORITHMICA
2006
97views more  ALGORITHMICA 2006»
13 years 9 months ago
Scalar Multiplication on Koblitz Curves Using the Frobenius Endomorphism and Its Combination with Point Halving: Extensions and
Abstract. In this paper we prove the optimality and other properties of the -adic nonadjacent form: this expansion has been introduced in order to efficiently compute scalar multip...
Roberto Maria Avanzi, Clemens Heuberger, Helmut Pr...
LICS
2002
IEEE
14 years 2 months ago
The Proof Complexity of Linear Algebra
We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We...
Michael Soltys, Stephen A. Cook