Sciweavers

501 search results - page 27 / 101
» Rough Sets and Approximation Schemes
Sort
View
GLOBECOM
2009
IEEE
14 years 4 months ago
Semi-Blind Gradient-Newton CMA and SDD Algorithm for MIMO Space-Time Equalisation
— Semi-blind space-time equalisation is considered for dispersive multiple-input multiple-output systems that employ high-throughput quadrature amplitude modulation signalling. A...
S. Chen, Lajos Hanzo, H.-T. Cheng
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
14 years 3 months ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
VISSYM
2003
13 years 11 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
IWVF
2001
Springer
14 years 2 months ago
Minimum-Length Polygons in Approximation Sausages
The paper introduces a new approximation scheme for planar digital curves. This scheme defines an approximating sausage ‘around’ the given digital curve, and calculates a mini...
Tetsuo Asano, Yasuyuki Kawamura, Reinhard Klette, ...
ISBI
2002
IEEE
14 years 2 months ago
A shape reconstruction method for diffuse optical tomography using a transport model and level sets
A two-step shape reconstruction method for diffuse optical tomography (DOT) is presented which uses adjoint fields and level sets. The propagation of near-infrared photons in tis...
O. Dorn