papers
Publications (16)
cs.DM2018
On Information-Theoretic Characterizations of Markov Random Fields and Subfields
Raymond W. Yeung, Ali Al-Bashabsheh, Chao Chen +2
cs.IT2015
On MMSE estimation from quantized observations in the nonasymptotic regime
Jaeho Lee, Maxim Raginsky, Pierre Moulin
cs.IT2006
Capacity and Random-Coding Exponents for Channel Coding with Side Information
Pierre Moulin, Ying Wang
cs.IT2011
On the Saddle-point Solution and the Large-Coalition Asymptotics of Fingerprinting Games
Yen-Wei Huang, Pierre Moulin
cs.IT2008
A Neyman-Pearson Approach to Universal Erasure and List Decoding
Pierre Moulin
cs.IT2008
Blind Fingerprinting
Ying Wang, Pierre Moulin
cs.IT2009
Saddle-point Solution of the Fingerprinting Capacity Game Under the Marking Assumption
Yen-Wei Huang, Pierre Moulin
cs.SI2012
Learning from Collective Intelligence in Groups
Guo-Jun Qi, Charu Aggarwal, Pierre Moulin +1
math.OC2017
Local and Global Convergence of an Inertial Version of Forward-Backward Splitting
Patrick R. Johnstone, Pierre Moulin
cs.IT2014
Fixed Error Asymptotics For Erasure and List Decoding
Vincent Y. F. Tan, Pierre Moulin
math.OC2016
Convergence Rates of Inertial Splitting Schemes for Nonconvex Composite Optimization
Patrick R. Johnstone, Pierre Moulin
cs.IT2007
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
Ying Wang, Pierre Moulin
cs.IT2011
Universal Fingerprinting: Capacity and Random-Coding Exponents
Pierre Moulin
cs.CV2016
Variable-Length Hashing
Honghai Yu, Pierre Moulin, Hong Wei Ng +1
cs.IT2005
On the existence and characterization of the maxent distribution under general moment inequality constraints
Prakash Ishwar, Pierre Moulin
cs.IT2016
The Log-Volume of Optimal Codes for Memoryless Channels, Asymptotically Within A Few Nats
Pierre Moulin