History


Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 | next | last

Result 1 to 20 of 43 total

Regret bounds for restless Markov bandits. (English)
Bshouty, Nader H. (ed.) et al., Algorithmic learning theory. 23rd international conference, ALT 2012, Lyon, France, October 29‒31, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-34105-2/pbk). Lecture Notes in Computer Science 7568. Lecture Notes in Artificial Intelligence, 214-228 (2012).
WorldCat.org
1
Constructing perfect steganographic systems. (English)
Inf. Comput. 209, No. 9, 1223-1230 (2011).
WorldCat.org
2
Sequence prediction in realizable and non-realizable cases. (English)
Comput. Res. Repos. 2010, Article No. 1005.5603 (2010).
WorldCat.org
3
Clustering processes. (English)
Comput. Res. Repos. 2010, Article No. 1005.0826 (2010).
WorldCat.org
4
Clustering processes. (English)
Comput. Res. Repos. 2010, Article No. 1004.5194 (2010).
WorldCat.org
5
Nonparametric statistical inference for ergodic processes (English)
IEEE Transactions on Information Theory 56, No. 3, 1430-1435 (2010).
WorldCat.org
6
Clustering processes (English)
ICML, 919-926 (2010).
WorldCat.org
7
Sequence prediction in realizable and non-realizable cases (English)
COLT, 119-131 (2010).
WorldCat.org
8
On finding predictors for arbitrary families of processes. (English)
Comput. Res. Repos. 2009, Article No. 0912.4883 (2009).
WorldCat.org
9
A criterion for hypothesis testing for stationary processes. (English)
Comput. Res. Repos. 2009, Article No. 0905.4937 (2009).
WorldCat.org
10
Characterizing predictable classes of processes. (English)
Comput. Res. Repos. 2009, Article No. 0905.4341 (2009).
WorldCat.org
11
Using data compressors to construct order tests for homogeneity and component independence. (English)
Appl. Math. Lett. 22, No. 7, 1029-1032 (2009).
WorldCat.org
12
Asymptotically optimal perfect steganographic systems. (English)
Probl. Inf. Transm. 45, No. 2, 184-190 (2009); translation from Probl. Peredachi Inf. 45, No. 2, 119-126 (2009).
WorldCat.org
13
Using Kolmogorov complexity for understanding some limitations on steganography. (English)
Comput. Res. Repos. 2009, Article No. 0901.4023 (2009).
WorldCat.org
14
Workshop summary: on-line learning with limited feedback (English)
ICML, 168 (2009).
WorldCat.org
15
Characterizing predictable classes of processes (English)
UAI, 471-478 (2009).
WorldCat.org
16
On the possibility of learning in reactive environments with arbitrary dependence. (English)
Comput. Res. Repos. 2008, Article No. 0810.5636 (2008).
WorldCat.org
17
An impossibility result for process discrimination. (English)
Comput. Res. Repos. 2008, Article No. 0809.1053 (2008).
WorldCat.org
18
Constructing perfect steganographic systems. (English)
Comput. Res. Repos. 2008, Article No. 0809.1593 (2008).
WorldCat.org
19
Testing statistical hypotheses about ergodic processes. (English)
Comput. Res. Repos. 2008, Article No. 0804.0510 (2008).
WorldCat.org
20
first | previous | 1 21 41 | next | last

Result 1 to 20 of 43 total

Valid XHTML 1.0 Transitional Valid CSS!