2520 search results - page 165 / 504 » The complexity of approximating entropy |
119
click to vote
CORR
2006
Springer
14 years 11 months ago
2006
Springer
In multiple-input multiple-output (MIMO) fading channels maximum likelihood (ML) detection is desirable to achieve high performance, but its complexity grows exponentially with th...
CAD
2005
Springer
14 years 10 months ago
2005
Springer
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
99
Voted
AIL
2004
14 years 10 months ago
2004
The paper identi es some of the problems with legal systems and outlines the potential of AI technology for overcoming them. For expository purposes, this outline is based on a si...
104
Voted
ATMOS
2010
14 years 10 months ago
2010
To model and solve optimization problems arising in public transportation, data about the passengers is necessary and has to be included in the models in any phase of the planning...
JAT
2010
14 years 9 months ago
2010
We consider H¨older smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges ...