T. S. Jayram

According to our database, T. S. Jayram authored at least 64 papers between 1994 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

CREPE: Learnable Prompting With CLIP Improves Visual Relationship Prediction.

Rakshith Subramanyam, T. S. Jayram, Rushil Anirudh, Jayaraman J. Thiagarajan

CoRR, 2023

Contrastive Knowledge-Augmented Meta-Learning for Few-Shot Classification.

Rakshith Subramanyam, Mark Heimann, T. S. Jayram, Rushil Anirudh, Jayaraman J. Thiagarajan

Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision, 2023

2022

A biology-informed similarity metric for simulated patches of human cell membrane.

Harsh Bhatia, Jayaraman J. Thiagarajan, Rushil Anirudh, T. S. Jayram, Tomas Oppelstrup, Helgi I. Ingólfsson, Felice C. Lightstone, Peer-Timo Bremer

Mach. Learn. Sci. Technol., 2022

The White-Box Adversarial Data Stream Model.

Miklós Ajtai, Vladimir Braverman, T. S. Jayram, Sandeep Silwal, Alec Sun, David P. Woodruff, Samson Zhou

Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

2019

Transfer Learning in Visual and Relational Reasoning.

T. S. Jayram, Vincent Marois, Tomasz Kornuta, Vincent Albouy, Emre Sevgen, Ahmet S. Ozcan

CoRR, 2019

Visually Grounded Video Reasoning in Selective Attention Memory.

T. S. Jayram, Vincent Albouy, Tomasz Kornuta, Emre Sevgen, Ahmet S. Ozcan

Proceedings of the Visually Grounded Interaction and Language (ViGIL), 2019

Controlling Attention in a Memory-Augmented Neural Network To Solve Working Memory Tasks.

T. S. Jayram, Younes Bouhadjar, Tomasz Kornuta, Ryan L. McAvoy, Alexis Asseman, Ahmet S. Ozcan

Proceedings of the 41th Annual Meeting of the Cognitive Science Society, 2019

2018

Randomized Communication versus Partition Number.

Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson

ACM Trans. Comput. Theory, 2018

A Note on Some Inequalities Used in Channel Polarization and Polar Coding.

T. S. Jayram, Erdal Arikan

IEEE Trans. Inf. Theory, 2018

On transfer learning using a MAC model variant.

Vincent Marois, T. S. Jayram, Vincent Albouy, Tomasz Kornuta, Younes Bouhadjar, Ahmet S. Ozcan

CoRR, 2018

Learning to Remember, Forget and Ignore using Attention Control in Memory.

T. S. Jayram, Younes Bouhadjar, Ryan L. McAvoy, Tomasz Kornuta, Alexis Asseman, Kamil Rocki, Ahmet S. Ozcan

CoRR, 2018

Simple Analyses of the Sparse Johnson-Lindenstrauss Transform.

Michael B. Cohen, T. S. Jayram, Jelani Nelson

Proceedings of the 1st Symposium on Simplicity in Algorithms, 2018

Using Multi-task and Transfer Learning to Solve Working Memory Tasks.

T. S. Jayram, Tomasz Kornuta, Ryan L. McAvoy, Ahmet S. Ozcan

Proceedings of the 17th IEEE International Conference on Machine Learning and Applications, 2018

2017

Resource-Efficient Common Randomness and Secret-Key Schemes.

Badih Ghazi, T. S. Jayram

Electron. Colloquium Comput. Complex., 2017

2015

Randomized Communication vs. Partition Number.

Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson

Electron. Colloquium Comput. Complex., 2015

A Composition Theorem for Conical Juntas.

Mika Göös, T. S. Jayram

Electron. Colloquium Comput. Complex., 2015

On Multiplicative Weight Updates for Concave and Submodular Function Maximization.

Chandra Chekuri, T. S. Jayram, Jan Vondrák

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

2014

Exchangeability and Realizability: De Finetti Theorems on Graphs.

T. S. Jayram, Jan Vondrák

Proceedings of the Approximation, 2014

2013

Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error.

T. S. Jayram, David P. Woodruff

ACM Trans. Algorithms, 2013

On the information complexity of cascaded norms with small domains.

T. S. Jayram

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Inferring connectivity model from meter measurements in distribution networks.

Vijay Arya, T. S. Jayram, Soumitra Pal, Shivkumar Kalyanaraman

Proceedings of the Fourth International Conference on Future Energy Systems, 2013

Online Optimization with Dynamic Temporal Uncertainty: Incorporating Short Term Predictions for Renewable Integration in Intelligent Energy Systems.

Vikas K. Garg, T. S. Jayram, Balakrishnan Narayanaswamy

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012

Optimal allocation of land area for a hybrid solar wind power plant.

Neha Sengupta, Kaushik Das, T. S. Jayram, Deva P. Seetharam

Proceedings of the IEEE Third International Conference on Smart Grid Communications, 2012

Prediction based storage management in the smart grid.

Balakrishnan Narayanaswamy, Vikas K. Garg, T. S. Jayram

Proceedings of the IEEE Third International Conference on Smart Grid Communications, 2012

Hedging strategies for renewable resource integration and uncertainty management in the smart grid.

Balakrishnan Narayanaswamy, T. S. Jayram, Voo Nyuk Yoong

Proceedings of the 3rd IEEE PES Innovative Smart Grid Technologies Europe, 2012

Online optimization for the smart (micro) grid.

Balakrishnan Narayanaswamy, Vikas K. Garg, T. S. Jayram

Proceedings of the 3rd International Conference on Energy-Efficient Computing and Networking, 2012

2011

Index Coding With Side Information.

Ziv Bar-Yossef, Yitzhak Birk, T. S. Jayram, Tomer Kol

IEEE Trans. Inf. Theory, 2011

Recovery of a Sparse Integer Solution to an Underdetermined System of Linear Equations

T. S. Jayram, Soumitra Pal, Vijay Arya

CoRR, 2011

Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Sub-Constant Error.

T. S. Jayram, David P. Woodruff

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010

Lower Bounds for Edit Distance and Product Metrics via Poincaré-Type Inequalities.

Alexandr Andoni, T. S. Jayram, Mihai Patrascu

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

Information complexity: a tutorial.

T. S. Jayram

Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010

2009

The Data Stream Space Complexity of Cascaded Norms.

T. S. Jayram, David P. Woodruff

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

On the Communication Complexity of Read-Once AC^0 Formulae.

T. S. Jayram, Swastik Kopparty, Prasad Raghavendra

Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009

Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND.

T. S. Jayram

Proceedings of the Approximation, 2009

2008

Estimating statistical aggregates on probabilistic data streams.

T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee

ACM Trans. Database Syst., 2008

The One-Way Communication Complexity of Hamming Distance.

T. S. Jayram, Ravi Kumar, D. Sivakumar

Theory Comput., 2008

Tight lower bounds for selection in randomly ordered streams.

Amit Chakrabarti, T. S. Jayram, Mihai Patrascu

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007

OLAP over uncertain and imprecise data.

Douglas Burdick, Prasad M. Deshpande, T. S. Jayram, Raghu Ramakrishnan, Shivakumar Vaithyanathan

VLDB J., 2007

Lower bounds for randomized read/write stream algorithms.

Paul Beame, T. S. Jayram, Atri Rudra

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Efficient aggregation algorithms for probabilistic data.

T. S. Jayram, Satyen Kale, Erik Vee

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Estimating the sortedness of a data stream.

Parikshit Gopalan, T. S. Jayram, Robert Krauthgamer, Ravi Kumar

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

Avatar Information Extraction System.

T. S. Jayram, Rajasekar Krishnamurthy, Sriram Raghavan, Shivakumar Vaithyanathan, Huaiyu Zhu

IEEE Data Eng. Bull., 2006

Efficient Allocation Algorithms for OLAP Over Imprecise Data.

Douglas Burdick, Prasad M. Deshpande, T. S. Jayram, Raghu Ramakrishnan, Shivakumar Vaithyanathan

Proceedings of the 32nd International Conference on Very Large Data Bases, 2006

The containment problem for REAL conjunctive queries with inequalities.

T. S. Jayram, Phokion G. Kolaitis, Erik Vee

Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

2004

Cell-probe lower bounds for the partial match problem.

T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani

J. Comput. Syst. Sci., 2004

An information statistics approach to data stream and communication complexity.

Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar

J. Comput. Syst. Sci., 2004

Exponential Separation of Quantum and Classical One-Way Communication Complexity

Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis

Electron. Colloquium Comput. Complex., 2004

Generalized Opinion Pooling.

Ashutosh Garg, T. S. Jayram, Shivakumar Vaithyanathan, Huaiyu Zhu

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2004

Approximating Edit Distance Efficiently.

Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar

Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

The Sketching Complexity of Pattern Matching.

Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar

Proceedings of the Approximation, 2004

2003

Two applications of information complexity.

T. S. Jayram, Ravi Kumar, D. Sivakumar

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2002

Using Control Theory to Achieve Service Level Objectives In Performance Management.

Sujay S. Parekh, Neha Gandhi, Joseph L. Hellerstein, Dawn M. Tilbury, T. S. Jayram, Joseph P. Bigus

Real Time Syst., 2002

Approximate counting of inversions in a data stream.

Miklós Ajtai, T. S. Jayram, Ravi Kumar, D. Sivakumar

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Counting Distinct Elements in a Data Stream.

Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan

Proceedings of the Randomization and Approximation Techniques, 6th International Workshop, 2002

Information Theory Methods in Communication Complexity.

Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar

Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002

2001

Time-Space Tradeoffs for Branching Programs.

Paul Beame, T. S. Jayram, Michael E. Saks

J. Comput. Syst. Sci., 2001

Tighter Bounds on Preemptive Job Shop Scheduling with Two Machines.

Eric J. Anderson, T. S. Jayram, Tracy Kimbrel

Computing, 2001

Online server allocation in a server farm via benefit task systems.

T. S. Jayram, Tracy Kimbrel, Robert Krauthgamer, Baruch Schieber, Maxim Sviridenko

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

2000

Analysis of Large-Scale Distributed Information Systems.

Joseph L. Hellerstein, T. S. Jayram, Mark S. Squillante

Proceedings of the MASCOTS 2000, Proceedings of the 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 29 August, 2000

Recognizing End-User Transactions in Performance Management.

Joseph L. Hellerstein, T. S. Jayram, Irina Rish

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1998

On Separating the Read-k-Times Branching Program Hierarchy

Jayram S. Thathachar

Electron. Colloquium Comput. Complex., 1998

On the Limitations of Ordered Representations of Functions.

Jayram S. Thathachar

Proceedings of the Computer Aided Verification, 10th International Conference, 1998

1997

Efficient Oblivious Branching Programs for Threshold and Mod Functions.

Rakesh K. Sinha, Jayram S. Thathachar

J. Comput. Syst. Sci., 1997

1994

Efficient Oblivious Branching Programs for Threshold Functions

Rakesh K. Sinha, Jayram S. Thathachar

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994