205 search results - page 7 / 41 » Efficient Algorithms for Universal Portfolios |
74
Voted
DCC
2004
IEEE
15 years 9 months ago
2004
IEEE
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
69
Voted
FUIN
2008
14 years 9 months ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...
70
Voted
CORR
2006
Springer
14 years 9 months ago
2006
Springer
The notion of universally decodable matrices (UDMs) was recently introduced by Tavildar and Viswanath while studying slow fading channels. It turns out that the problem of construc...
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper we present a new method for image coding that is able to achieve good results over a wide range of image types. This work is based on the Multidimensional Multiscale...
MM
2004
ACM
15 years 2 months ago
2004
ACM
Growing numbers of pervasive devices are gaining access to the Internet. However, much of the existing rich multimedia content cannot be handled by mobile client devices with limi...