Author image not provided
 Manjesh Kumar Hanawal

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article0.29
Citation Count2
Publication count7
Publication years2009-2015
Available for download3
Average downloads per article110.00
Downloads (cumulative)330
Downloads (12 Months)26
Downloads (6 Weeks)3
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


7 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 7 of 7
Sort by:

1
July 2015 ICML'15: Proceedings of the 32nd International Conference on International Conference on Machine Learning - Volume 37
Publisher: JMLR.org
Bibliometrics:
Citation Count: 0

We consider stochastic sequential learning problems where the learner can observe the average reward of several actions . Such a setting is interesting in many applications involving monitoring and surveillance, where the set of the actions to observe represent some (geographical) area. The importance of this setting is that in ...

2 published by ACM
October 2014 ACM Transactions on Internet Technology (TOIT) - Special Issue on Pricing and Incentives in Networks and Systems and Regular Papers: Volume 14 Issue 2-3, October 2014
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 17,   Downloads (Overall): 146

Full text available: PDFPDF
Representatives of several Internet service providers (ISPs) have expressed their wish to see a substantial change in the pricing policies of the Internet. In particular, they would like to see content providers (CPs) pay for use of the network, given the large amount of resources they use. This would be ...
Keywords: network neutrality, off-network pricing, proportional sharing, Games, telecommunications policy, two-sided market

3 published by ACM
October 2012 ACM SIGMETRICS Performance Evaluation Review: Volume 40 Issue 2, September 2012
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 5,   Downloads (Overall): 66

Full text available: PDFPDF
This paper studies the impact of exclusive contracts between a content provider (CP) and an internet service provider (ISP) in a nonneutral network. We consider a simple linear demand function for the CPs. We studywhen an exclusive contract is benefcial to the colluding pair and evaluate its impact on the ...

4 published by ACM
December 2011 ACM SIGMETRICS Performance Evaluation Review: Volume 39 Issue 3, December 2011
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 0,   Downloads (12 Months): 4,   Downloads (Overall): 118

Full text available: PDFPDF
The growing awareness to negative impact of wireless technology on our environment has lead to designing green networks in which energy saving plays an important role. We consider energy saving by switching off a fraction of the base stations. This saving comes at some cost: the coverage is reduced, and ...

5
April 2011 IEEE Transactions on Information Theory: Volume 57 Issue 4, April 2011
Publisher: IEEE Press
Bibliometrics:
Citation Count: 0

The Shannon cipher system is studied in the context of general sources using a notion of computational secrecy introduced by Merhav and Arikan. Bounds are derived on limiting exponents of guessing moments for general sources. The bounds are shown to be tight for i.i.d., Markov, and unifilar sources, thus recovering ...
Keywords: Cipher systems, error exponent, large deviations, correct decoding exponent, fixed-rate source coding, secrecy, sources with memory, key rate, length function, information spectrum

6
January 2011 IEEE Transactions on Information Theory: Volume 57 Issue 1, January 2011
Publisher: IEEE Press
Bibliometrics:
Citation Count: 1

The problem of guessing a random string is revisited. A close relation between guessing and compression is first established. Then it is shown that if the sequence of distributions of the information spectrum satisfies the large deviation property with a certain rate function, then the limiting guessing exponent exists and ...
Keywords: information spectrum, Guessing, large deviations, source coding, length function

7
June 2009 ISIT'09: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Publisher: IEEE Press
Bibliometrics:
Citation Count: 0

The Shannon cipher system is studied in the context of general sources using a notion of computational secrecy introduced by Merhav & Arikan. Bounds are derived on limiting exponents of guessing moments for general sources. The bounds are shown to be tight for iid, Markov, and unifilar sources, thus recovering ...



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