Sciweavers

358 search results - page 52 / 72
» Sparse squares of polynomials
Sort
View
STACS
2001
Springer
14 years 4 days ago
Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra
It is well known that finite square matrices over a Kleene algebra again form a Kleene algebra. This is also true for infinite matrices under suitable restrictions. One can use t...
Dexter Kozen
ICAI
2007
13 years 9 months ago
Dynamic Programming Algorithm for Training Functional Networks
Abstract— The paper proposes a dynamic programming algorithm for training of functional networks. The algorithm considers each node as a state. The problem is formulated as find...
Emad A. El-Sebakhy, Salahadin Mohammed, Moustafa E...
VISSYM
2003
13 years 9 months ago
Adaptive Smooth Scattered Data Approximation for Large-scale Terrain Visualization
We present a fast method that adaptively approximates large-scale functional scattered data sets with hierarchical B-splines. The scheme is memory efficient, easy to implement an...
Martin Bertram, Xavier Tricoche, Hans Hagen
TIT
1998
96views more  TIT 1998»
13 years 7 months ago
Nonparametric Estimation of Transfer Functions: Rates of Convergence and Adaptation
Abstract— The paper deals with estimating transfer functions of stable linear time-invariant systems under stochastic assumptions. We adopt a nonparametric minimax approach for m...
Alexander Goldenshluger
CDC
2009
IEEE
109views Control Systems» more  CDC 2009»
13 years 5 months ago
Exact solution for the max-min quantum error recovery problem
This paper considers the max-min quantum error recovery problem; the recovery channel to be designed maximizes the fidelity between input and output states of a given noisy channel...
Naoki Yamamoto