Erik Ordentlich

César A. Uribe

Alexander V. Gasnikov

EURO J. Comput. Optim., 2022

2020

Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions.

[BibT_eX]

[DOI]

CoRR, 2020

2019

On the Pointwise Threshold Behavior of the Binary Erasure Polarization Subchannels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

2018

Scalable Query N-Gram Embedding for Improving Matching and Relevance in Sponsored Search.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

2016

Scalable Semantic Matching of Queries to Ads in Sponsored Search Advertising.

[BibT_eX]

[DOI]

Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, 2016

Network-Efficient Distributed Word2vec Training System for Large Vocabularies.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

2014

When data must satisfy constraints upon writing.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013

Twice-Universal Denoising.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Hamming-weight constrained coded arrays based on covering codes.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Denoising as well as the best of any two denoisers.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

Low Complexity Two-Dimensional Weight-Constrained Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Asymptotic Enumeration of Binary Matrices with Bounded Row and Column Sums.

[BibT_eX]

[DOI]

Farzad Parvaresh

SIAM J. Discret. Math., 2012

Piecewise constant prediction.

[BibT_eX]

[DOI]

Yihong Wu

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

On q-ary antipodal matchings and applications.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

On Multi-Directional Context Sets.

[BibT_eX]

[DOI]

Cheng Chang

IEEE Trans. Inf. Theory, 2011

Two-Dimensional Maximum-Likelihood Sequence Detection Is NP Hard.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Analysis of Deterministic Binary Interference Channels Via a General Outer Bound.

[BibT_eX]

[DOI]

Raúl Hernán Etkin

IEEE Trans. Inf. Theory, 2011

The iDUDE Framework for Grayscale Image Denoising.

[BibT_eX]

[DOI]

IEEE Trans. Image Process., 2011

Energy-optimized lossless compression: Rate-variability tradeoff.

[BibT_eX]

[DOI]

Yihong Wu

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Asymptotic enumeration of binary matrices with bounded row and column weights.

[BibT_eX]

[DOI]

Farzad Parvaresh

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

Error exponents of optimum decoding for the interference channel.

[BibT_eX]

[DOI]

Raúl Hernán Etkin

IEEE Trans. Inf. Theory, 2010

Toward properties of twice-universality in denoising.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

Lower Limits of Discrete Universal Denoising.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

The degrees-of-freedom of the K-user Gaussian interference channel is discontinuous at rational channel coefficients.

[BibT_eX]

[DOI]

Raúl H. Etkin

IEEE Trans. Inf. Theory, 2009

Joint source-channel coding for transmitting correlated sources over broadcast networks.

[BibT_eX]

[DOI]

Todd P. Coleman

Emin Martinian

IEEE Trans. Inf. Theory, 2009

On concentration for denoiser-loss estimators.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Approximate enumerative coding for 2-D constraints through ratios of maprix Products.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

On the Degrees-of-Freedom of the K-user Gaussian interference channel.

[BibT_eX]

[DOI]

Raúl H. Etkin

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Universal Algorithms for Channel Decoding of Uncompressed Sources.

[BibT_eX]

[DOI]

Sergio Verdú

IEEE Trans. Inf. Theory, 2008

Defect list compression.

[BibT_eX]

[DOI]

Giovanni Motta

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007

Universal Filtering Via Prediction.

[BibT_eX]

[DOI]

Anelia Somekh-Baruch

IEEE Trans. Inf. Theory, 2007

Capacity Lower Bounds and Approximate Enumerative Coding for 2-D Constraints.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

Discrete Memoryless Interference Channel: New Outer Bound.

[BibT_eX]

[DOI]

Raúl H. Etkin

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

On the optimality of symbol-by-symbol filtering and denoising.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Maximizing the entropy of a sum of independent bounded random variables.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

On causal and semicausal codes for joint information embedding and source coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Maximum entropy lighting for physical objects.

[BibT_eX]

[DOI]

Thomas Malzbender

Proceedings of the Visualization and Data Analysis 2006, 2006

Joint Source-Channel Decoding for Transmitting Correlated Sources over Broadcast Networks.

[BibT_eX]

[DOI]

Todd P. Coleman

Emin Martinian

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005

Universal discrete denoising: known channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

The empirical distribution of rate-constrained source codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

A distribution dependent refinement of Pinsker's inequality.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

Multi-directional context sets with applications to universal denoising and compression.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Approximations for the entropy rate of a hidden Markov process.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Asymptotic filtering and entropy rate of a hidden Markov process in the rare transitions regime.

[BibT_eX]

[DOI]

Chandra Nair

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

The DUDE framework for continuous tone image denoising.

[BibT_eX]

[DOI]

Proceedings of the 2005 International Conference on Image Processing, 2005

2004

Independent Sets in Regular Hypergraphs and Multidimensional Runlength-Limited Constraints.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2004

Efficient pruning of bi-directional context trees with applications to universal denoising and compression.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE Information Theory Workshop, 2004

New bounds on the entropy rate of hidden Markov processes.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE Information Theory Workshop, 2004

Channel decoding of systematically encoded unknown redundant sources.

[BibT_eX]

[DOI]

Sergio Verdú

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Discrete Universal Filtering Through Incremental Parsing.

[BibT_eX]

[DOI]

Anelia Somekh-Baruch

Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

2003

A discrete universal denoiser and its application to binary images.

[BibT_eX]

[DOI]

Sergio Verdú

Proceedings of the 2003 International Conference on Image Processing, 2003

2002

On delayed prediction of individual sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

On sequential strategies for loss functions with memory.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

Embedded block coding in JPEG 2000.

[BibT_eX]

[DOI]

David Taubman

Signal Process. Image Commun., 2002

Universal discrete denoising.

[BibT_eX]

[DOI]

Proceedings of the 2002 IEEE Information Theory Workshop, 2002

2000

Two-dimensional weight-constrained codes through enumeration bounds.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

On-Line Decision Making for a Class of Loss Functions via Lempel-Ziv Parsing.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2000

1999

Memory Efficient Scalable Line-based Image Coding.

[BibT_eX]

[DOI]

David Taubman

Michael W. Marcellin

Proceedings of the Data Compression Conference, 1999

1998

The Cost of Achieving the Best Portfolio in Hindsight.

[BibT_eX]

[DOI]

Math. Oper. Res., 1998

A Low-Complexity Modeling Approach for Embedded Coding of Wavelet Coefficients.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 1998

1996

On the factor-of-two bound for Gaussian multiple-access channels with feedback.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

Universal portfolios with side information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

On-Line Portfolio Selection.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual Conference on Computational Learning Theory, 1996

Max-min optimal investing.

[BibT_eX]

[DOI]

Proceedings of the IEEE/IAFE 1996 Conference on Computational Intelligence for Financial Engineering, 1996

1990

Low-delay code-excited linear-predictive coding of wideband speech at 32 kbps.

[BibT_eX]

[DOI]

Yair Shoham