T. S. Jayram

81 papers A* 25A 5B 3C 1Misc 1Journal 31Unranked 15
YearRankTypeTitle / Venue / Authors
2026 J jnl
Better Learning-Augmented Spanning Tree Algorithms via Metric Forest Completion.
CoRR
Nate Veldt, Thomas Stanley, Benjamin W. Priest, Trevor Steil, Keita Iwabuchi, T. S. Jayram, Grace J. Li, Geoffrey Sanders
2025 A* conf
Approximate Forest Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees.
ICML
Nate Veldt, Thomas Stanley, Benjamin W. Priest, Trevor Steil, Keita Iwabuchi, T. S. Jayram, Geoffrey Sanders
2025 J jnl
Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees.
CoRR
Nate Veldt, Thomas Stanley, Benjamin W. Priest, Trevor Steil, Keita Iwabuchi, T. S. Jayram, Geoffrey Sanders
2024 — conf
'Eyes of a Hawk and Ears of a Fox': Part Prototype Network for Generalized Zero-Shot Learning.
CVPR Workshops
Joshua Feinglass, Jayaraman J. Thiagarajan, Rushil Anirudh, T. S. Jayram, Yezhou Yang
2024 J jnl
'Eyes of a Hawk and Ears of a Fox': Part Prototype Network for Generalized Zero-Shot Learning.
CoRR
Joshua Feinglass, Jayaraman J. Thiagarajan, Rushil Anirudh, T. S. Jayram, Yezhou Yang
2024 Misc conf
Exploring the Utility of Clip Priors for Visual Relationship Prediction.
ICASSP
Rakshith Subramanyam, T. S. Jayram, Rushil Anirudh, Jayaraman J. Thiagarajan
2023 J jnl
CREPE: Learnable Prompting With CLIP Improves Visual Relationship Prediction.
CoRR
Rakshith Subramanyam, T. S. Jayram, Rushil Anirudh, Jayaraman J. Thiagarajan
2023 A conf
Contrastive Knowledge-Augmented Meta-Learning for Few-Shot Classification.
WACV
Rakshith Subramanyam, Mark Heimann, T. S. Jayram, Rushil Anirudh, Jayaraman J. Thiagarajan
2022 J jnl
A biology-informed similarity metric for simulated patches of human cell membrane.
Mach. Learn. Sci. Technol.
Harsh Bhatia, Jayaraman J. Thiagarajan, Rushil Anirudh, T. S. Jayram, Tomas Oppelstrup, Helgi I. Ingólfsson, Felice C. Lightstone, Peer-Timo Bremer
2022 A* conf
The White-Box Adversarial Data Stream Model.
PODS
Miklós Ajtai, Vladimir Braverman, T. S. Jayram, Sandeep Silwal, Alec Sun, David P. Woodruff, Samson Zhou
2022 J jnl
The White-Box Adversarial Data Stream Model.
CoRR
Miklós Ajtai, Vladimir Braverman, T. S. Jayram, Sandeep Silwal, Alec Sun, David P. Woodruff, Samson Zhou
2019 B conf
Controlling Attention in a Memory-Augmented Neural Network To Solve Working Memory Tasks.
CogSci
T. S. Jayram, Younes Bouhadjar, Tomasz Kornuta, Ryan L. McAvoy, Alexis Asseman, Ahmet S. Ozcan
2019 J jnl
Transfer Learning in Visual and Relational Reasoning.
CoRR
T. S. Jayram, Vincent Marois, Tomasz Kornuta, Vincent Albouy, Emre Sevgen, Ahmet S. Ozcan
2019 — conf
Visually Grounded Video Reasoning in Selective Attention Memory.
ViGIL@NeurIPS
T. S. Jayram, Vincent Albouy, Tomasz Kornuta, Emre Sevgen, Ahmet S. Ozcan
2018 J jnl
A Note on Some Inequalities Used in Channel Polarization and Polar Coding.
IEEE Trans. Inf. Theory
T. S. Jayram, Erdal Arikan
2018 J jnl
Learning to Remember, Forget and Ignore using Attention Control in Memory.
CoRR
T. S. Jayram, Younes Bouhadjar, Ryan L. McAvoy, Tomasz Kornuta, Alexis Asseman, Kamil Rocki, Ahmet S. Ozcan
2018 J jnl
On transfer learning using a MAC model variant.
CoRR
Vincent Marois, T. S. Jayram, Vincent Albouy, Tomasz Kornuta, Younes Bouhadjar, Ahmet S. Ozcan
2018 J jnl
Randomized Communication versus Partition Number.
ACM Trans. Comput. Theory
Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson
2018 A* conf
Resource-Efficient Common Randomness and Secret-Key Schemes.
SODA
Badih Ghazi, T. S. Jayram
2018 — conf
Simple Analyses of the Sparse Johnson-Lindenstrauss Transform.
SOSA
Michael B. Cohen, T. S. Jayram, Jelani Nelson
2018 C conf
Using Multi-task and Transfer Learning to Solve Working Memory Tasks.
ICMLA
T. S. Jayram, Tomasz Kornuta, Ryan L. McAvoy, Ahmet S. Ozcan
2018 J jnl
Using Multi-task and Transfer Learning to Solve Working Memory Tasks.
CoRR
T. S. Jayram, Tomasz Kornuta, Ryan L. McAvoy, Ahmet S. Ozcan
2017 A* conf
Randomized Communication vs. Partition Number.
ICALP
Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson
2017 J jnl
Resource-Efficient Common Randomness and Secret-Key Schemes.
CoRR
Badih Ghazi, T. S. Jayram
2017 J jnl
Resource-Efficient Common Randomness and Secret-Key Schemes.
Electron. Colloquium Comput. Complex.
Badih Ghazi, T. S. Jayram
2016 A conf
A Composition Theorem for Conical Juntas.
CCC
Mika Göös, T. S. Jayram
2016 J jnl
A note on some inequalities used in channel polarization and polar coding.
CoRR
T. S. Jayram, Erdal Arikan
2015 J jnl
A Composition Theorem for Conical Juntas.
Electron. Colloquium Comput. Complex.
Mika Göös, T. S. Jayram
2015 A conf
On Multiplicative Weight Updates for Concave and Submodular Function Maximization.
ITCS
Chandra Chekuri, T. S. Jayram, Jan Vondrák
2015 J jnl
Randomized Communication vs. Partition Number.
Electron. Colloquium Comput. Complex.
Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson
2014 — conf
Exchangeability and Realizability: De Finetti Theorems on Graphs.
APPROX-RANDOM
T. S. Jayram, Jan Vondrák
2013 — conf
Inferring connectivity model from meter measurements in distribution networks.
e-Energy
Vijay Arya, T. S. Jayram, Soumitra Pal, Shivkumar Kalyanaraman
2013 B conf
On the information complexity of cascaded norms with small domains.
ITW
T. S. Jayram
2013 A* conf
Online Optimization with Dynamic Temporal Uncertainty: Incorporating Short Term Predictions for Renewable Integration in Intelligent Energy Systems.
AAAI
Vikas K. Garg, T. S. Jayram, Balakrishnan Narayanaswamy
2013 J jnl
Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error.
ACM Trans. Algorithms
T. S. Jayram, David P. Woodruff
2012 — conf
Hedging strategies for renewable resource integration and uncertainty management in the smart grid.
ISGT Europe
Balakrishnan Narayanaswamy, T. S. Jayram, Voo Nyuk Yoong
2012 — conf
Online optimization for the smart (micro) grid.
e-Energy
Balakrishnan Narayanaswamy, Vikas K. Garg, T. S. Jayram
2012 — conf
Optimal allocation of land area for a hybrid solar wind power plant.
SmartGridComm
Neha Sengupta, Kaushik Das, T. S. Jayram, Deva P. Seetharam
2012 — conf
Prediction based storage management in the smart grid.
SmartGridComm
Balakrishnan Narayanaswamy, Vikas K. Garg, T. S. Jayram
2011 J jnl
Index Coding With Side Information.
IEEE Trans. Inf. Theory
Ziv Bar-Yossef, Yitzhak Birk, T. S. Jayram, Tomer Kol
2011 A* conf
Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Sub-Constant Error.
SODA
T. S. Jayram, David P. Woodruff
2011 J jnl
Recovery of a Sparse Integer Solution to an Underdetermined System of Linear Equations
CoRR
T. S. Jayram, Soumitra Pal, Vijay Arya
2010 A* conf
Information complexity: a tutorial.
PODS
T. S. Jayram
2010 A* conf
Lower Bounds for Edit Distance and Product Metrics via Poincaré-Type Inequalities.
SODA
Alexandr Andoni, T. S. Jayram, Mihai Patrascu
2009 — conf
Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND.
APPROX-RANDOM
T. S. Jayram
2009 A conf
On the Communication Complexity of Read-Once AC^0 Formulae.
CCC
T. S. Jayram, Swastik Kopparty, Prasad Raghavendra
2009 A* conf
The Data Stream Space Complexity of Cascaded Norms.
FOCS
T. S. Jayram, David P. Woodruff
2008 J jnl
Estimating statistical aggregates on probabilistic data streams.
ACM Trans. Database Syst.
T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee
2008 J jnl
Exponential Separation of Quantum and Classical One-Way Communication Complexity.
SIAM J. Comput.
Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis
2008 J jnl
The One-Way Communication Complexity of Hamming Distance.
Theory Comput.
T. S. Jayram, Ravi Kumar, D. Sivakumar
2008 A* conf
Tight lower bounds for selection in randomly ordered streams.
SODA
Amit Chakrabarti, T. S. Jayram, Mihai Patrascu
2007 A* conf
Efficient aggregation algorithms for probabilistic data.
SODA
T. S. Jayram, Satyen Kale, Erik Vee
2007 A* conf
Estimating statistical aggregates on probabilistic data streams.
PODS
T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee
2007 A* conf
Estimating the sortedness of a data stream.
SODA
Parikshit Gopalan, T. S. Jayram, Robert Krauthgamer, Ravi Kumar
2007 A* conf
Lower bounds for randomized read/write stream algorithms.
STOC
Paul Beame, T. S. Jayram, Atri Rudra
2007 J jnl
OLAP over uncertain and imprecise data.
VLDB J.
Douglas Burdick, Prasad M. Deshpande, T. S. Jayram, Raghu Ramakrishnan, Shivakumar Vaithyanathan
2006 J jnl
Avatar Information Extraction System.
IEEE Data Eng. Bull.
T. S. Jayram, Rajasekar Krishnamurthy, Sriram Raghavan, Shivakumar Vaithyanathan, Huaiyu Zhu
2006 A* conf
Efficient Allocation Algorithms for OLAP Over Imprecise Data.
VLDB
Douglas Burdick, Prasad M. Deshpande, T. S. Jayram, Raghu Ramakrishnan, Shivakumar Vaithyanathan
2006 A* conf
Index Coding with Side Information.
FOCS
Ziv Bar-Yossef, Yitzhak Birk, T. S. Jayram, Tomer Kol
2006 A* conf
The containment problem for REAL conjunctive queries with inequalities.
PODS
T. S. Jayram, Phokion G. Kolaitis, Erik Vee
2005 A* conf
OLAP Over Uncertain and Imprecise Data.
VLDB
Douglas Burdick, Prasad Deshpande, T. S. Jayram, Raghu Ramakrishnan, Shivakumar Vaithyanathan
2004 J jnl
An information statistics approach to data stream and communication complexity.
J. Comput. Syst. Sci.
Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar
2004 A* conf
Approximating Edit Distance Efficiently.
FOCS
Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar
2004 J jnl
Cell-probe lower bounds for the partial match problem.
J. Comput. Syst. Sci.
T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani
2004 J jnl
Exponential Separation of Quantum and Classical One-Way Communication Complexity
Electron. Colloquium Comput. Complex.
Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis
2004 A* conf
Exponential separation of quantum and classical one-way communication complexity.
STOC
Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis
2004 — conf
Generalized Opinion Pooling.
AI&M
Ashutosh Garg, T. S. Jayram, Shivakumar Vaithyanathan, Huaiyu Zhu
2004 — conf
The Sketching Complexity of Pattern Matching.
APPROX-RANDOM
Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar
2003 A* conf
Cell-probe lower bounds for the partial match problem.
STOC
T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani
2003 A* conf
Two applications of information complexity.
STOC
T. S. Jayram, Ravi Kumar, D. Sivakumar
2002 A* conf
An Information Statistics Approach to Data Stream and Communication Complexity.
FOCS
Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar
2002 A* conf
Approximate counting of inversions in a data stream.
STOC
Miklós Ajtai, T. S. Jayram, Ravi Kumar, D. Sivakumar
2002 — conf
Counting Distinct Elements in a Data Stream.
RANDOM
Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan
2002 A conf
Information Theory Methods in Communication Complexity.
CCC
Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar
2002 J jnl
Using Control Theory to Achieve Service Level Objectives In Performance Management.
Real Time Syst.
Sujay S. Parekh, Neha Gandhi, Joseph L. Hellerstein, Dawn M. Tilbury, T. S. Jayram, Joseph P. Bigus
2001 A* conf
Online server allocation in a server farm via benefit task systems.
STOC
T. S. Jayram, Tracy Kimbrel, Robert Krauthgamer, Baruch Schieber, Maxim Sviridenko
2001 J jnl
Tighter Bounds on Preemptive Job Shop Scheduling with Two Machines.
Computing
Eric J. Anderson, T. S. Jayram, Tracy Kimbrel
2001 J jnl
Time-Space Tradeoffs for Branching Programs.
J. Comput. Syst. Sci.
Paul Beame, T. S. Jayram, Michael E. Saks
2001 — conf
Using Control Theory to Achieve Service Level Objectives In Performance Management.
Integrated Network Management
Sujay S. Parekh, Neha Gandhi, Joseph L. Hellerstein, Dawn M. Tilbury, T. S. Jayram, Joseph P. Bigus
2000 B conf
Analysis of Large-Scale Distributed Information Systems.
MASCOTS
Joseph L. Hellerstein, T. S. Jayram, Mark S. Squillante
2000 — conf
Recognizing End-User Transactions in Performance Management.
AAAI/IAAI
Joseph L. Hellerstein, T. S. Jayram, Irina Rish