Sciweavers

12194 search results - page 2155 / 2439
» Numberings Optimal for Learning
Sort
View
CORR
2007
Springer
101views Education» more  CORR 2007»
15 years 6 months ago
On The Limitations of The Naive Lattice Decoding
In this paper, the inherent drawbacks of the naive lattice decoding for MIMO fading systems is investigated. We show that using the naive lattice decoding for MIMO systems has con...
Mahmoud Taherzadeh, Amir K. Khandani
CORR
2007
Springer
89views Education» more  CORR 2007»
15 years 6 months ago
Speeding up Simplification of Polygonal Curves using Nested Approximations
: We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used betwe...
Pierre-Francois Marteau, Gildas Ménier
171
Voted
IPL
2006
115views more  IPL 2006»
15 years 6 months ago
Approximate maximum weight branchings
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...
Amitabha Bagchi, Ankur Bhargava, Torsten Suel
JMLR
2008
141views more  JMLR 2008»
15 years 6 months ago
A New Algorithm for Estimating the Effective Dimension-Reduction Subspace
The statistical problem of estimating the effective dimension-reduction (EDR) subspace in the multi-index regression model with deterministic design and additive noise is consider...
Arnak S. Dalalyan, Anatoly Juditsky, Vladimir Spok...
JAIR
2006
87views more  JAIR 2006»
15 years 6 months ago
Fault Tolerant Boolean Satisfiability
A -model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yi...
Amitabha Roy
« Prev « First page 2155 / 2439 Last » Next »