default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTony Jacob
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j4]Kumar K. P. Vijith
, Brijesh Kumar Rai, Tony Jacob:
Towards the Optimal Rate Memory Tradeoff in Caching With Coded Placement. IEEE Trans. Inf. Theory 69(4): 2093-2112 (2023)- [c9]Vijith Kumar K. P, Brijesh Kumar Rai, Tony Jacob:
The Optimal Rate Memory Tradeoff in Multi-Access Coded Caching: Large Cache Size. ITW 2023: 165-169 - 2021
- [c8]Vijith Kumar K. P, Brijesh Kumar Rai, Tony Jacob:
Pareto Optimal Schemes in Coded Caching: Uncoded Prefetching. ISIT 2021: 2537-2541 - [i3]Vijith Kumar K. P, Brijesh Kumar Rai, Tony Jacob:
The Exact Rate Memory Tradeoff for Large Caches with Coded Placement. CoRR abs/2101.09785 (2021) - [i2]Vijith Kumar K. P, Brijesh Kumar Rai, Tony Jacob:
The Exact Rate Memory Tradeoff for Small Caches with Coded Placement. CoRR abs/2102.04797 (2021) - 2020
- [c7]Vijith Kumar K. P, Brijesh Kumar Rai, Tony Jacob:
Towards the Exact Memory Rate Tradeoff for the (4, 5) Cache Network. SPCOM 2020: 1-5
2010 – 2019
- 2019
- [j3]Palakkattillam Sandeep, Tony Jacob:
Joint Color Space GMMs for CFA Demosaicking. IEEE Signal Process. Lett. 26(2): 232-236 (2019) - [c6]Vijith Kumar K. P, Brijesh Kumar Rai, Tony Jacob:
Fundamental Limits of Coded Caching: The Memory Rate Pair (K - 1 - 1/K, 1/(K-1)). ISIT 2019: 2624-2628 - [c5]Vijith Kumar K. P, Brijesh Kumar Rai, Tony Jacob:
Pareto Optimal Schemes in Coded Caching. ISIT 2019: 2629-2633 - [c4]Kumar K. P. Vijith, Brijesh Kumar Rai, Tony Jacob:
Towards the Exact Rate Memory Tradeoff in Coded Caching. NCC 2019: 1-6 - [i1]Vijith Kumar K. P, Brijesh Kumar Rai, Tony Jacob:
Fundamental Limits of Coded Caching: The Memory Rate Pair (K-1-1/K, 1/(K-1)). CoRR abs/1905.08471 (2019) - 2016
- [j2]Palakkattillam Sandeep, Tony Jacob:
Single Image Super-Resolution Using a Joint GMM Method. IEEE Trans. Image Process. 25(9): 4233-4244 (2016) - 2014
- [c3]Rahul Nallamothu, T. Vineeth, Gaurav Kumar Yadav, Amit Sethi, Tony Jacob:
Interest Point Detection in Videos Using Long Point Trajectories. ICVGIP 2014: 70:1-70:5 - 2013
- [j1]Tony Jacob, Rakesh Kumar Bansal:
Almost Sure Optimality of Sliding Window Lempel-Ziv Algorithm and Variants Revisited. IEEE Trans. Inf. Theory 59(8): 4977-4984 (2013) - [c2]Palakkattillam Sandeep, Tony Jacob:
Image restoration from multiple copies: A GMM based method. ICASSP 2013: 1593-1597
2000 – 2009
- 2008
- [c1]Tony Jacob, Rakesh Kumar Bansal:
Sequential change detection based on universal compression algorithms. ISIT 2008: 1108-1112
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
