default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntony Joseph
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Man Shi, Vikram Jain, Antony Joseph, Maurice Meijer, Marian Verhelst
:
BitWave: Exploiting Column-Based Bit-Level Sparsity for Deep Learning Acceleration. HPCA 2024: 732-746- [i5]Man Shi, Steven Colleman, Charlotte VanDeMieroop, Antony Joseph, Maurice Meijer, Wim Dehaene, Marian Verhelst:
CMDS: Cross-layer Dataflow Optimization for DNN Accelerators Exploiting Multi-bank Memories. CoRR abs/2406.14574 (2024) - 2023
- [c7]Man Shi, Steven Colleman, Charlotte VanDeMieroop, Antony Joseph, Maurice Meijer, Wim Dehaene, Marian Verhelst:
CMDS: Cross-layer Dataflow Optimization for DNN Accelerators Exploiting Multi-bank Memories. ISQED 2023: 1-8 - 2021
- [c6]Antony Joseph, Juan Wu, Kaiyan Yu, Lan Jiang, Nathaniel C. Cady, Bing Si:
Function-on-Function Regression for Trajectory Prediction of Small-Scale Particles towards Next-generation Neuromorphic Computing. CASE 2021: 1997-2002
2010 – 2019
- 2014
- [j4]Antony Joseph, Andrew R. Barron:
Fast Sparse Superposition Codes Have Near Exponential Error Probability for $R<{\cal C}$. IEEE Trans. Inf. Theory 60(2): 919-942 (2014) - [j3]Ramji Venkataramanan, Antony Joseph, Sekhar Tatikonda:
Lossy Compression via Sparse Linear Regression: Performance Under Minimum-Distance Encoding. IEEE Trans. Inf. Theory 60(6): 3254-3264 (2014) - [c5]Antony Joseph, Bin Yu:
Impact of regularization on spectral clustering. ITA 2014: 1-2 - 2013
- [j2]Antony Joseph:
Variable selection in high-dimension with random designs and orthogonal matching pursuit. J. Mach. Learn. Res. 14(1): 1771-1800 (2013) - 2012
- [j1]Antony Joseph, Andrew R. Barron:
Least Squares Superposition Codes of Moderate Dictionary Size Are Reliable at Rates up to Capacity. IEEE Trans. Inf. Theory 58(5): 2541-2557 (2012) - [c4]Ramji Venkataramanan, Antony Joseph, Sekhar Tatikonda:
Gaussian rate-distortion via sparse linear regression over compact dictionaries. ISIT 2012: 368-372 - [i4]Ramji Venkataramanan, Antony Joseph, Sekhar Tatikonda:
Gaussian Rate-Distortion via Sparse Regression over Compact Dictionaries. CoRR abs/1202.0840 (2012) - [i3]Antony Joseph, Andrew R. Barron:
Fast Sparse Superposition Codes have Exponentially Small Error Probability for R < C. CoRR abs/1207.2406 (2012) - 2011
- [c3]Andrew R. Barron, Antony Joseph:
Analysis of fast sparse superposition codes. ISIT 2011: 1772-1776 - 2010
- [c2]Andrew R. Barron, Antony Joseph:
Least squares superposition codes of moderate dictionary size, reliable at rates up to capacity. ISIT 2010: 275-279 - [c1]Andrew R. Barron, Antony Joseph:
Toward fast reliable communication at rates near capacity with Gaussian noise. ISIT 2010: 315-319 - [i2]Andrew R. Barron, Antony Joseph:
Least Squares Superposition Codes of Moderate Dictionary Size, Reliable at Rates up to Capacity. CoRR abs/1006.3780 (2010) - [i1]Andrew R. Barron, Antony Joseph:
Toward Fast Reliable Communication at Rates Near Capacity with Gaussian Noise. CoRR abs/1006.3870 (2010)
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 2024-08-05 21:18 CEST 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:
