Sciweavers

1813 search results - page 37 / 363
» Calculi of Approximation Spaces
Sort
View
VTC
2007
IEEE
103views Communications» more  VTC 2007»
15 years 10 months ago
A Simple Orthogonal Space-Time-Polarization Block Code
— This letter proposes a simple but highly efficient technique to jointly utilize space, time, and polarization diversities. The technique is based on extending orthogonal space-...
Beata J. Wysocki, Tadeusz A. Wysocki, Jennifer Seb...
ECCC
2010
98views more  ECCC 2010»
15 years 3 months ago
A Note on Randomized Streaming Space Bounds for the Longest Increasing Subsequence Problem
The deterministic space complexity of approximating the length of the longest increasing subsequence of a stream of N integers is known to be ( N). However, the randomized comple...
Amit Chakrabarti
131
Voted
IJCAI
2003
15 years 5 months ago
Approximate Policy Iteration using Large-Margin Classifiers
We present an approximate policy iteration algorithm that uses rollouts to estimate the value of each action under a given policy in a subset of states and a classifier to general...
Michail G. Lagoudakis, Ronald Parr
131
Voted
ESANN
2008
15 years 5 months ago
Approximation of Gaussian process regression models after training
The evaluation of a standard Gaussian process regression model takes time linear in the number of training data points. In this paper, the models are approximated in the feature sp...
Thorsten Suttorp, Christian Igel
165
Voted
MOC
2010
14 years 10 months ago
Discontinuous Galerkin approximations of the Stokes and Navier-Stokes equations
Numerical schemes to compute approximate solutions of the evolutionary Stokes and Navier-Stokes equations are studied. The schemes are discontinuous in time and conforming in space...
Konstantinos Chrysafinos, Noel Walkington