Author image not provided
 T S Jayram

Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article7.71
Citation Count54
Publication count7
Publication years2009-2013
Available for download4
Average downloads per article333.00
Downloads (cumulative)1,332
Downloads (12 Months)114
Downloads (6 Weeks)17
Arrow RightAuthor only

See all colleagues of this author

See all subject areas


7 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 7 of 7
Sort by:

1 published by ACM
June 2013 ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11: Volume 9 Issue 3, June 2013
Publisher: ACM
Citation Count: 7
Downloads (6 Weeks): 8,   Downloads (12 Months): 23,   Downloads (Overall): 171

Full text available: PDFPDF
The Johnson-Lindenstrauss transform is a dimensionality reduction technique with a wide range of applications to theoretical computer science. It is specified by a distribution over projection matrices from R n → R k where k n and states that k = O ( ϵ −2 log 1/ δ ) dimensions ...
Keywords: distinct elements, frequency moments, Communication complexity, data streams, entropy

2 published by ACM
May 2012 e-Energy '12: Proceedings of the 3rd International Conference on Future Energy Systems: Where Energy, Computing and Communication Meet
Publisher: ACM
Citation Count: 8
Downloads (6 Weeks): 4,   Downloads (12 Months): 23,   Downloads (Overall): 419

Full text available: PDFPDF
Growing environmental awareness and new government directives have set the stage for an increase in the fraction of energy supplied using renewable resources. The fast variation in renewable power, coupled with uncertainty in availability, emphasizes the need for algorithms for intelligent online generation scheduling. These algorithms should allow us to ...
Keywords: online gradient decent, regret, economic dispatch, intelligent generator scheduling, online convex optimization (OCO)

March 2011 IEEE Transactions on Information Theory: Volume 57 Issue 3, March 2011
Publisher: IEEE Press
Citation Count: 9

Motivated by a problem of transmitting supplemental data over broadcast channels (Birk and Kol, INFOCOM 1998), we study the following coding problem: a sender communicates with n receivers R 1 ,..., R n . He holds an input x ∈ {0,01l} n and wishes to broadcast a single message so ...
Keywords: Broadcast channels, code length, information cost, error correction coding

January 2011 SODA '11: Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Citation Count: 9
Downloads (6 Weeks): 2,   Downloads (12 Months): 11,   Downloads (Overall): 83

Full text available: PDFPDF
The Johnson-Lindenstrauss transform is a dimensionality reduction technique with a wide range of applications to theoretical computer science. It is specified by a distribution over projection matrices from R n → R k where k ≪ d and states that k = O (ε −2 log 1/δ) dimensions suffice to ...

5 published by ACM
June 2010 PODS '10: Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Publisher: ACM
Citation Count: 1
Downloads (6 Weeks): 3,   Downloads (12 Months): 57,   Downloads (Overall): 659

Full text available: PDFPDF
The recent years have witnessed the overwhelming success of algorithms that operate on massive data. Several computing paradigms have been proposed for massive data set algorithms such as data streams, sketching, sampling etc. and understanding their limitations is a fundamental theoretical challenge. In this survey, we describe the information complexity ...
Keywords: sketching, communication complexity, streams, geometry, information theory, statistics, information complexity

October 2009 FOCS '09: Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Publisher: IEEE Computer Society
Citation Count: 14

We consider the problem of estimating cascaded aggregates over a matrix presented as a sequence of updates in a data stream. A cascaded aggregate P �Q is defined by evaluating aggregate Q repeatedly over each row of the matrix, and then evaluating aggregate P over the resulting vector of values. ...

July 2009 CCC '09: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
Publisher: IEEE Computer Society
Citation Count: 4

We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication complexity of the function f(x, y) = T(x \circ y) is \Omega(n/4^d) where (x \circ y) is defined so that the resulting tree ...
Keywords: Communication complexity, Information complexity, AND-OR trees, Lower bounds

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us