O. Cappe - Citegraph

Author Info

Name	Affiliation	Papers
O. CAPPE	ECOLE NATL SUPER TELECOMMUN BRETAGNE,DEPT SIGNAL,CNRS,URA 820,F-75634 PARIS 13,FRANCE	64
Collaborators	Citations	PageRank
77	2112	207.95
Referers	Referees	References
4410	844	503

Search Limit

1001000

Publications (64 rows)

Collaborators (77 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Efficient Algorithms for Stochastic Repeated Second-price Auctions	0	0.34	2021
Self-Concordant Analysis Of Generalized Linear Bandits With Forgetting	0	0.34	2021
On Limited-Memory Subsampling Strategies For Bandits	0	0.34	2021
Algorithms for Online Influencer Marketing.	2	0.63	2019
Weighted Linear Bandits for Non-Stationary Environments	0	0.34	2019
Stochastic Bandit Models For Delayed Conversions	2	0.38	2017
Online Model-Free Influence Maximization with Persistence.	0	0.34	2017
Sequential ranking under random semi-bandit feedback.	0	0.34	2016
On the Complexity of Best-Arm Identification in Multi-Armed Bandit Models.	12	0.56	2016
Multiple-Play Bandits in the Position-Based Model.	10	0.57	2016
Learning from missing data using selection bias in movie recommendation	0	0.34	2015
Soft Nonnegative Matrix Co-Factorization	1	0.40	2014
Piecewise constant nonnegative matrix factorization	1	0.37	2014
On the Complexity of Best Arm Identification in Multi-Armed Bandit Models.	184	5.73	2014
On the Complexity of A/B Testing.	7	0.57	2014
Soft nonnegative matrix co-factorizationwith application to multimodal speaker diarization	9	0.52	2013
Kernel-Based Methods for Hypothesis Testing: A Unified View.	6	0.45	2013
On Bayesian Upper Confidence Bounds for Bandit Problems.	52	2.47	2012
On Bayesian Upper Confidence Bounds for Bandit Problems	0	0.34	2012
Adaptive MCMC with online relabeling	0	0.34	2012
Adaptive Metropolis with Online Relabeling	0	0.34	2012
The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond	0	0.34	2011
The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond	126	7.24	2011
Text segmentation: A topic modeling perspective	22	0.81	2011
Optimally Sensing a Single Channel Without Prior Information: The Tiling Algorithm and Regret Bounds	6	0.66	2011
Robust changepoint detection based on multivariate rank statistics	3	0.45	2011
Practical very large scale CRFs	152	5.06	2010
Optimism in Reinforcement Learning Based on Kullback-Leibler Divergence	0	0.34	2010
Parametric Bandits: The Generalized Linear Case.	61	2.74	2010
Text segmentation via topic modeling: an analytical study	40	1.43	2009
Efficient Learning of Sparse Conditional Random Fields for Supervised Sequence Labelling	2	0.38	2009
Selecting features with L1 regularization in Conditional Random Fields.	0	0.34	2009
Distributed detection/localization of change-points in high-dimensional network traffic data	3	0.43	2009
A regularized kernel-based approach to unsupervised audio segmentation	10	1.27	2009
Regret Bounds for Opportunistic Channel Access	0	0.34	2009
Using LDA to detect semantically incoherent documents.	21	1.28	2008
The asymptotics of semi-supervised learning in discriminative probabilistic models	15	0.75	2008
A Near Optimal Policy for Channel Allocation in Cognitive Radio	6	0.73	2008
Adaptive importance sampling in general mixture classes	57	5.14	2008
Robust similarity measures for named entities matching	28	0.96	2008
An Overview of Existing Methods and Recent Advances in Sequential Monte Carlo	263	16.86	2007
Inference and evaluation of the multinomial mixture model for text clustering	19	1.00	2006
Recursive Em Algorithm With Applications To Doa Estimation	5	0.67	2006
Comparison of resampling schemes for particle filtering	186	11.77	2005
On the use of particle filtering for maximum likelihood parameter estimation	7	1.59	2005
Long-range dependence and heavy-tail modeling for teletraffic data	35	2.47	2002
A Bayesian approach for simultaneous segmentation and classification of count data	2	0.41	2002
Recursive computation of smoothed functionals of hidden Markovian processes using a particle approximation	3	0.90	2001
Erratum to: “Special Section on Markov Chain Monte Carlo (MCMC) Methods for Signal Processing” [Signal Processing 81 (1) (January 2001) 1–83]	0	0.34	2001
Estimation of the spectral envelope of voiced sounds using a penalized likelihood approach	16	0.99	2001

1
2
50 / page