412 search results - page 54 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
ICANNGA
2007
Springer
15 years 3 months ago
2007
Springer
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
116
click to vote
ICIP
2001
IEEE
16 years 1 months ago
2001
IEEE
In standard predictive video coders, intra-mode coding of macroblocks (MBs) provides packet loss resilience, at the cost of reduced compression efficiency. Conventional mode selec...
100
click to vote
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— We show a statistical pruning approach for maximum likelihood (ML) detection of multiple-input multiple-output (MIMO) systems. We present a general pruning strategy for...
130
click to vote
TNN
2010
14 years 6 months ago
2010
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...
108
click to vote
ECRTS
2004
IEEE
15 years 3 months ago
2004
IEEE
This paper targets energy-efficient scheduling of tasks over multiple processors, where tasks share a common deadline. Distinct from many research results on heuristics-based ener...