Serap A. Savari

CoRR, 2024

A Counterexample in Image Registration.

[BibT_eX]

[DOI]

CoRR, 2024

On Image Registration and Subpixel Estimation.

[BibT_eX]

[DOI]

CoRR, 2024

2022

On the Construction of Distribution-Free Prediction Intervals for an Image Regression Problem in Semiconductor Manufacturing.

[BibT_eX]

[DOI]

Inimfon I. Akpabio

S. M. Hossein Tabatabaei Yazdi

CoRR, 2022

2015

Lossless Layout Image Compression Algorithms for Electron-Beam Direct-Write Lithography.

[BibT_eX]

[DOI]

CoRR, 2015

2014

On the Relationships Among Optimal Symmetric Fix-Free Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

2013

A Deterministic Polynomial-Time Algorithm for Constructing a Multicast Coding Scheme for Linear Deterministic Relay Networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

2012

On Optimal and Achievable Fix-Free Codes.

[BibT_eX]

[DOI]

S. M. Hossein Tabatabaei Yazdi

Navid Abedini

Sunil P. Khatri

IEEE Trans. Inf. Theory, 2012

2011

Network Coding in Node-Constrained Line and Star Networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

A Max-Flow/Min-Cut Algorithm for Linear Deterministic Relay Networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

A deterministic polynomialtime algorithm for constructing a multicast coding scheme for linear deterministic relay networks.

[BibT_eX]

[DOI]

Proceedings of the 45st Annual Conference on Information Sciences and Systems, 2011

2010

On the multimessage capacity region for undirected ring networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

A Lossless Circuit Layout Image Compression Algorithm for Maskless Lithography Systems.

[BibT_eX]

[DOI]

Jeehong Yang

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

When Huffman Meets Hamming: A Class of Optimal Variable-Length Error Correcting Codes.

[BibT_eX]

[DOI]

Jörg Kliewer

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

A SAT-Based Scheme to Determine Optimal Fix-Free Codes.

[BibT_eX]

[DOI]

Navid Abedini

Sunil P. Khatri

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

2009

A Combinatorial Study of Linear Deterministic Relay Networks

[BibT_eX]

[DOI]

CoRR, 2009

On Minimum-Redundancy Fix-Free Codes.

[BibT_eX]

[DOI]

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

2008

On One-to-One Codes for Memoryless Cost Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Network coding in star networks.

[BibT_eX]

[DOI]

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

An Approach to Graph and Netlist Compression.

[BibT_eX]

[DOI]

Jeehong Yang

Oskar Mencer

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

Network coding on line networks with broadcast.

[BibT_eX]

[DOI]

Proceedings of the 42nd Annual Conference on Information Sciences and Systems, 2008

A study of the routing capacity regions of networks.

[BibT_eX]

[DOI]

Ali Kakhbod

Proceedings of the 42nd Asilomar Conference on Signals, Systems and Computers, 2008

2007

Communicating Probability Distributions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

A Multimessage Capacity Region for Undirected Ring Networks.

[BibT_eX]

[DOI]

Farzad Farnoud

Proceedings of the IEEE International Symposium on Information Theory, 2007

The Capacity Region of a Collection of Multicast Sessions in an Undirected Ring Network.

[BibT_eX]

[DOI]

Kelli Carlson

Proceedings of the 2007 International Conference on Parallel Processing Workshops (ICPP Workshops 2007), 2007

Dictionary-based English text compression using word endings.

[BibT_eX]

[DOI]

Jeehong Yang

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

2006

Edge-Cut Bounds on Network Coding Rates.

[BibT_eX]

[DOI]

J. Netw. Syst. Manag., 2006

The Multimessage Unicast Capacity Region for Bidirectional Ring Networks.

[BibT_eX]

[DOI]

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

Precise Asymptotic Analysis of the Tunstall Code.

[BibT_eX]

[DOI]

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

2005

Progressive d-separating edge set bounds on network coding rates.

[BibT_eX]

[DOI]

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

2004

Compression of words over a partially commutative alphabet.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Bounds on the expected cost of one-to-one codes.

[BibT_eX]

[DOI]

Akshay Naheta

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

Cut sets and information flow in networks of two-way channels.

[BibT_eX]

[DOI]

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

2003

Compressing a Representation of Events in a Concurrent System.

[BibT_eX]

[DOI]

Proceedings of the Advances in Network Information Theory, 2003

On networks of two-way channels.

[BibT_eX]

Proceedings of the Algebraic Coding Theory and Information Theory, 2003

On Compressing Interchange Classes of Events in a Concurrent System.

[BibT_eX]

[DOI]

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

2001

On optimal permutation codes.

[BibT_eX]

[DOI]

Vivek K. Goyal

Wei Wang

IEEE Trans. Inf. Theory, 2001

Low Delay Perpetually Lossless Coding of Audio Signals.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2001

2000

A probabilistic approach to some asymptotics in noiseless communication.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

Renewal theory and source coding.

[BibT_eX]

[DOI]

Proc. IEEE, 2000

Comparing and Combining Profiles.

[BibT_eX]

[DOI]

Cliff Young

J. Instr. Level Parallelism, 2000

1999

Variable-to-fixed length codes and the conservation of entropy.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

Variable-to-Fixed Length Codes and Plurally Parsable Dictionaries.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 1999

1998

Redundancy of the Lempel-Ziv String Matching Code.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1998

Variable to Fixed Length Codes for Predictable Sources.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 1998

1997

Generalized Tunstall codes for sources with memory.

[BibT_eX]

[DOI]

Robert G. Gallager

IEEE Trans. Inf. Theory, 1997

Redundancy of the Lempel-Ziv incremental parsing rule.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

A probabilistic approach to some asymptotics in source coding.

[BibT_eX]

[DOI]

Proceedings of the Compression and Complexity of SEQUENCES 1997, 1997

Redundancy of the Lempel-Ziv-Welch Code.

[BibT_eX]

[DOI]

Proceedings of the 7th Data Compression Conference (DCC '97), 1997

1996

Variable-to-fixed length codes for sources with known and unknown memory.

[BibT_eX]

[DOI]

PhD thesis, 1996

Finite Termination of Asynchronous Iterative Algorithms.

[BibT_eX]

[DOI]

Dimitri P. Bertsekas

Parallel Comput., 1996

1995

On the Entropy of DNA: Algorithms and Measurements Based on Memory and Rapid Convergence.

[BibT_eX]

[DOI]

Martin Farach

Michiel O. Noordewier

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

1994

Arithmetic coding for finite-state noiseless channels.

[BibT_eX]

[DOI]

Robert G. Gallager

IEEE Trans. Inf. Theory, 1994

Some notes on Varn coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

1993

Average Case Analysis of Five Two-Dimensional Bubble Sorting Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

1992

Arithmetic Coding for Memoryless Cost Channels.

[BibT_eX]

[DOI]