Sciweavers

3038 search results - page 198 / 608
» High-Speed Function Approximation
Sort
View
JC
2011
87views more  JC 2011»
15 years 1 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski
CATS
2006
15 years 7 months ago
Boolean equation solving as graph traversal
We present a new method for finding closed forms of recursive Boolean function definitions. Traditionally, these closed forms are found by iteratively approximating until a fixed ...
Brian Herlihy, Peter Schachte, Harald Sønde...
136
Voted
MOC
2002
92views more  MOC 2002»
15 years 6 months ago
Asymptotic properties of the spectral test, diaphony, and related quantities
This paper presents the limit laws of discrepancies defined via exponential sums, and algorithms (with error bounds) to approximate the corresponding distribution functions. The re...
Hannes Leeb
TCS
2002
15 years 6 months ago
Complexity measures and decision tree complexity: a survey
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
Harry Buhrman, Ronald de Wolf
ICRA
2008
IEEE
165views Robotics» more  ICRA 2008»
16 years 26 days ago
Comparison of robotic and clinical motor function improvement measures for sub-acute stroke patients
Abstract— In this paper, preliminary results in motor function improvement for four sub-acute stroke patients that underwent a hybrid robotic and traditional rehabilitation progr...
Ozkan Celik, Marcia Kilchenman O'Malley, Corwin Bo...