Luis A. Lastras

Siva Sankalp Patel

Sachindra Joshi

Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2021

Doc2Bot: Document grounded Bot Framework.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Lattice Representation Learning.

[BibT_eX]

[DOI]

CoRR, 2020

End-to-End Spoken Language Understanding Without Full Transcripts.

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Conference of the International Speech Communication Association, 2020

Conversational Document Prediction to Assist Customer Care Agents.

[BibT_eX]

[DOI]

Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing, 2020

doc2dial: A Goal-Oriented Document-Grounded Dialogue Dataset.

[BibT_eX]

[DOI]

Song Feng

Hui Wan

Siva Sankalp Patel

Sachindra Joshi

Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing, 2020

Agent Assist through Conversation Analysis.

[BibT_eX]

[DOI]

Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: System Demonstrations, 2020

Implicit Discourse Relation Classification: We Need to Talk about Evaluation.

[BibT_eX]

[DOI]

Najoung Kim

Song Feng

Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, 2020

Doc2Dial: A Framework for Dialogue Composition Grounded in Documents.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

The Eighth Dialog System Technology Challenge.

[BibT_eX]

[DOI]

CoRR, 2019

Planning for Goal-Oriented Dialogue Systems.

[BibT_eX]

[DOI]

Christian Muise

Tathagata Chakraborti

Shubham Agarwal

Ondrej Bajgar

Arunima Chaudhary

Josef Ondrej

Miroslav Vodolán

Charlie Wiecha

CoRR, 2019

Generating Dialogue Agents via Automated Planning.

[BibT_eX]

[DOI]

CoRR, 2019

Information Theoretic lower bounds on negative log likelihood.

[BibT_eX]

[DOI]

Proceedings of the 7th International Conference on Learning Representations, 2019

MAi: An Intelligent Model Acquisition Interface for Interactive Specification of Dialogue Agents.

[BibT_eX]

[DOI]

Tathagata Chakraborti

Christian Muise

Shubham Agarwal

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2017

On the Reliability Function of Variable-Rate Slepian-Wolf Coding.

[BibT_eX]

[DOI]

Entropy, 2017

2016

A Proximity Measure using Blink Model.

[BibT_eX]

[DOI]

CoRR, 2016

Concept Evolution Modeling Using Semantic Vectors.

[BibT_eX]

[DOI]

Tin Kam Ho

Oded Shmueli

Proceedings of the 25th International Conference on World Wide Web, 2016

Watson Concept Insights: A Conceptual Association Framework.

[BibT_eX]

[DOI]

Michele M. Franceschini

Livio B. Soares

Proceedings of the 25th International Conference on World Wide Web, 2016

2015

Cognitive Master Teacher.

[BibT_eX]

[DOI]

Raghu Krishnapuram

Satya V. Nitta

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

On the Capacity of Memoryless Rewritable Storage Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Verification of Galois field based circuits by formal reasoning based on computational algebraic geometry.

[BibT_eX]

[DOI]

Alexey Lvov

Formal Methods Syst. Des., 2014

Adapting Server Systems for New Memory Technologies.

[BibT_eX]

[DOI]

Hillery C. Hunter

Bishwaranjan Bhattacharjee

Computer, 2014

2012

IBM zEnterprise redundant array of independent memory subsystem.

[BibT_eX]

[DOI]

Patrick J. Meaney

Vesselina K. Papazova

IBM J. Res. Dev., 2012

Coding strategies for the uniform noise rewritable channel with hidden state.

[BibT_eX]

[DOI]

Ramji Venkataramanan

Sekhar Tatikonda

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

On codes for structured bursts.

[BibT_eX]

[DOI]

Mario Blaum

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

PreSET: Improving performance of phase change memories by exploiting asymmetry in write times.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Computer Architecture (ISCA 2012), 2012

Formal verification of error correcting circuits using computational algebraic geometry.

[BibT_eX]

[DOI]

Alexey Lvov

Viresh Paruthi

Robert Shadowen

Ali El-Zein

Proceedings of the Formal Methods in Computer-Aided Design, 2012

2011

A new class of array codes for memory storage.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2011

Practical and secure PCM systems by online detection of malicious write streams.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on High-Performance Computer Architecture (HPCA-17 2011), 2011

2010

Write amplification reduction in NAND Flash through multi-write coding.

[BibT_eX]

[DOI]

Proceedings of the IEEE 26th Symposium on Mass Storage Systems and Technologies, 2010

Information theory based design of phase-change memories.

[BibT_eX]

[DOI]

John P. Karidis

Proceedings of the Information Theory and Applications Workshop, 2010

Rewritable storage channels with limited number of rewrite iterations.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

Algorithms for memories with stuck cells.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

Coding for sensing in Content Addressable Memories.

[BibT_eX]

[DOI]

Bipin Rajendran

C. Lam

Proceedings of the IEEE International Symposium on Information Theory, 2010

The capacity of the uniform noise rewritable channel with average cost.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

Morphable memory system: a robust architecture for exploiting multi-level phase change memories.

[BibT_eX]

[DOI]

Moinuddin K. Qureshi

John P. Karidis

Proceedings of the 37th International Symposium on Computer Architecture (ISCA 2010), 2010

Coding for Multilevel Heterogeneous Memories.

[BibT_eX]

[DOI]

Roger Cheek

Proceedings of IEEE International Conference on Communications, 2010

A Communication-Theoretic Approach to Phase Change Storage.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2010

Improving read performance of Phase Change Memories via Write Cancellation and Write Pausing.

[BibT_eX]

[DOI]

Moinuddin K. Qureshi

Proceedings of the 16th International Conference on High-Performance Computer Architecture (HPCA-16 2010), 2010

2009

On the redundancy of Slepian--Wolf coding.

[BibT_eX]

[DOI]

Dake He

IEEE Trans. Inf. Theory, 2009

On the linear codebook-level duality between Slepian-Wolf coding and channel coding.

[BibT_eX]

[DOI]

Dake He

IEEE Trans. Inf. Theory, 2009

The role of feedback in rewritable storage channels [Lecture Notes].

[BibT_eX]

[DOI]

IEEE Signal Process. Mag., 2009

Enhancing lifetime and security of PCM-based main memory with start-gap wear leveling.

[BibT_eX]

[DOI]

Moinuddin K. Qureshi

John P. Karidis

Vijayalakshmi Srinivasan

Bülent Abali

Proceedings of the 42st Annual IEEE/ACM International Symposium on Microarchitecture (MICRO-42 2009), 2009

On the lifetime of multilevel memories.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Rewritable Channels With Data-Dependent Noise.

[BibT_eX]

[DOI]

Ibrahim M. Elfadel

Proceedings of IEEE International Conference on Communications, 2009

2008

On Universal Variable-Rate Slepian-Wolf Coding.

[BibT_eX]

[DOI]

Dake He

Proceedings of IEEE International Conference on Communications, 2008

2007

Redundancy of Variable Rate Slepian-Wolf Codes from the Decoder's Perspective.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

Reliable Memories with Subline Accesses.

[BibT_eX]

[DOI]

Junsheng Han

Proceedings of the IEEE International Symposium on Information Theory, 2007

On the Redundancy-Error Tradeoff in Slepian-Wolf Coding and Channel Coding.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Near sufficiency of random coding for two descriptions.

[BibT_eX]

[DOI]

Vittorio Castelli

IEEE Trans. Inf. Theory, 2006

On Successive Refinement of the Binary Symmetric Markov Source.

[BibT_eX]

[DOI]

Toby Berger

IEEE Trans. Inf. Theory, 2006

Bounds on expansion in LZ'77-like coding.

[BibT_eX]

[DOI]

Vittorio Castelli

IEEE Trans. Inf. Theory, 2006

Victim management in a cache hierarchy.

[BibT_eX]

[DOI]

Peter A. Franaszek

Steven R. Kunkel

Aaron Sawdey

IBM J. Res. Dev., 2006

Exponential bounds and stopping rules for MCMC and general Markov chains.

[BibT_eX]

[DOI]

Ioannis Kontoyiannis

Sean P. Meyn

Proceedings of the 1st International Conference on Performance Evaluation Methodolgies and Tools, 2006

A Lower Bound for Variable Rate Slepian-Wolf Coding.

[BibT_eX]

[DOI]

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

Data Compression with Restricted Parsings.

[BibT_eX]

[DOI]

Peter A. Franaszek

Song Peng

John T. Robinson

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

2005

Relative entropy and exponential deviation bounds for general Markov chains.

[BibT_eX]

[DOI]

Ioannis Kontoyiannis

Sean P. Meyn

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

Near Tightness of the El Gamal and Cover Region for Two Descriptions.

[BibT_eX]

[DOI]

Vittorio Castelli

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

Distributed Source Coding in Dense Sensor Networks.

[BibT_eX]

[DOI]

Akshay Kashyap

Cathy H. Xia

Zhen Liu

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

2004

Nonasymptotic upper bounds on the probability of the epsilon-atypical set for Markov chains.

[BibT_eX]

[DOI]

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

On certain pathwise properties of the sliding-window Lempel Ziv algorithm.

[BibT_eX]

[DOI]

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

2001

All sources are nearly successively refinable.

[BibT_eX]

[DOI]