2520 search results - page 198 / 504 » The complexity of approximating entropy |
150
click to vote
ICC
2007
IEEE
16 years 5 days ago
2007
IEEE
— In this paper, a low-complexity high-performance detection algorithm for multiple input multiple output (MIMO) channels with severe delay spread is proposed. This algorithm per...
164
click to vote
IJCNN
2007
IEEE
16 years 2 days ago
2007
IEEE
— This work addresses the problem of selecting a subset of basis functions for a model linear in the parameters for regression tasks. Basis functions from a set of candidates are...
189
click to vote
LATIN
2004
Springer
15 years 11 months ago
2004
Springer
We address the problem of searching for a two-dimensional pattern in a two-dimensional text (or image), such that the pattern can be found even if it appears rotated and it is bri...
137
click to vote
ICSM
2002
IEEE
15 years 10 months ago
2002
IEEE
We present an empirical evaluation of three contextsensitive slicing algorithms and five context-sensitive chopping algorithms, and compare them to context-insensitive methods. B...
155
click to vote
RT
1995
Springer
15 years 9 months ago
1995
Springer
Multiple scattering in participating media is generally a complex phenomenon. In the limit of an optically thick medium, i.e., when the mean free path of each photon is much smalle...