default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaolo D'Alberto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]Paolo D'Alberto, Taehee Jeong, Akshai Jain, Shreyas Manjunath, Mrinal Sarmah, Samuel Hsu, Yaswanth Raparti, Nitesh Pipralia:
Weight Block Sparsity: Training, Compilation, and AI Engine Accelerators. CoRR abs/2407.09453 (2024)- 2023
- [i9]Paolo D'Alberto, Veronica Milenkiy, Fairiz Fi Azizi:
Digital Advertising: the Measure of Mobile Visits Lifts. CoRR abs/2307.12875 (2023) - [i8]Paolo D'Alberto, Abhishek Kumar Jain, Ismail Bustany, Henri Fraisse, Mansimran Benipal:
Entropy Maximization in Sparse Matrix by Vector Multiplication (maxESpMV). CoRR abs/2308.00106 (2023) - [i7]Paolo D'Alberto:
Strassen's Matrix Multiplication Algorithm Is Still Faster. CoRR abs/2312.12732 (2023) - 2022
- [j5]Paolo D'Alberto
, Victor Wu, Aaron Ng, Rahul Nimaiyar, Elliott Delaye, Ashish Sirasao:
xDNN: Inference for Deep Convolutional Neural Networks. ACM Trans. Reconfigurable Technol. Syst. 15(2): 18:1-18:29 (2022) - [c16]Mihnea Chirila, Paolo D'Alberto, Hsin-Yu Ting, Alexander V. Veidenbaum, Alexandru Nicolau:
A Heterogeneous Solution to the All-pairs Shortest Path Problem using FPGAs. ISQED 2022: 108-113 - 2021
- [i6]Paolo D'Alberto, Jiangsha Ma, Jintao Li, Yiming Hu, Manasa Bollavaram, Shaoxia Fang:
DPUV3INT8: A Compiler View to programmable FPGA Inference Engines. CoRR abs/2110.04327 (2021)
2010 – 2019
- 2018
- [i5]Sean O. Settle, Manasa Bollavaram, Paolo D'Alberto, Elliott Delaye, Oscar Fernandez, Nicholas Fraser, Aaron Ng, Ashish Sirasao, Michael Wu:
Quantizing Convolutional Neural Networks for Low-Power High-Throughput Inference Engines. CoRR abs/1805.07941 (2018) - 2015
- [i4]Paolo D'Alberto, Veronica Milenkly:
Mapping and Matching Algorithms: Data Mining by Adaptive Graphs. CoRR abs/1501.00491 (2015) - [i3]Paolo D'Alberto:
Binary and Polytomous Responses Modeling: Multiple-Campaign Ad-Targeting Without Personal User Information. CoRR abs/1501.02185 (2015) - 2013
- [c15]Matthew Badin, Paolo D'Alberto, Lubomir Bic, Michael B. Dillencourt, Alexandru Nicolau:
Improving numerical accuracy for non-negative matrix multiplication on GPUs using recursive algorithms. ICS 2013: 213-222 - 2012
- [i2]Paolo D'Alberto:
A Heterogeneous Accelerated Matrix Multiplication: OpenCL + APU + GPU+ Fast Matrix Multiply. CoRR abs/1205.2927 (2012) - 2011
- [j4]Paolo D'Alberto, Marco Bodrato, Alexandru Nicolau:
Exploiting parallelism in matrix-computation kernels for symmetric multiprocessor systems: Matrix-multiplication and matrix-addition algorithm optimizations by software pipelining and threads allocation. ACM Trans. Math. Softw. 38(1): 2:1-2:30 (2011) - [c14]Rosario Cammarota, Arun Kejariwal, Paolo D'Alberto, Sapan Panigrahi, Alexander V. Veidenbaum, Alexandru Nicolau:
Pruning hardware evaluation space via correlation-driven application similarity analysis. Conf. Computing Frontiers 2011: 4 - [c13]Matthew Badin, Paolo D'Alberto, Lubomir Bic, Michael B. Dillencourt, Alexandru Nicolau:
Improving the Accuracy of High Performance BLAS Implementations Using Adaptive Blocked Algorithms. SBAC-PAD 2011: 120-127 - [i1]Paolo D'Alberto, Ali Dasdan:
On the Weakenesses of Correlation. CoRR abs/1107.2691 (2011)
2000 – 2009
- 2009
- [j3]Paolo D'Alberto, Alexandru Nicolau:
Adaptive Winograd's matrix multiplications. ACM Trans. Math. Softw. 36(1): 3:1-3:23 (2009) - [c12]Ali Dasdan, Paolo D'Alberto, Santanu Kolay, Chris Drome:
Automatic retrieval of similar content using search engine query interface. CIKM 2009: 701-710 - [c11]Paolo D'Alberto, Ali Dasdan:
Non-parametric Information-Theoretic Measures of One-Dimensional Distribution Functions from Continuous Time Series. SDM 2009: 685-696 - 2008
- [c10]Franz Franchetti, Yevgen Voronenko, Peter A. Milder, Srinivas Chellappa, Marek R. Telgarsky, Hao Shen, Paolo D'Alberto, Frédéric de Mesmay, James C. Hoe, José M. F. Moura, Markus Püschel:
Domain-specific library generation for parallel software and hardware platforms. IPDPS 2008: 1-5 - 2007
- [j2]Paolo D'Alberto, Alexandru Nicolau:
R-Kleene: A High-Performance Divide-and-Conquer Algorithm for the All-Pair Shortest Path for Densely Connected Networks. Algorithmica 47(2): 203-213 (2007) - [c9]Paolo D'Alberto, Peter A. Milder, Aliaksei Sandryhaila, Franz Franchetti, James C. Hoe, José M. F. Moura, Markus Püschel, Jeremy R. Johnson:
Generating FPGA-Accelerated DFT Libraries. FCCM 2007: 173-184 - [c8]Paolo D'Alberto, Markus Püschel, Franz Franchetti:
Performance/Energy Optimization of DSP Transforms on the XScale Processor. HiPEAC 2007: 201-214 - [c7]Paolo D'Alberto, Alexandru Nicolau:
Adaptive Strassen's matrix multiplication. ICS 2007: 284-292 - 2005
- [j1]Paolo D'Alberto, Alexandru Nicolau, Alexander V. Veidenbaum, Rajesh K. Gupta:
Line Size Adaptivity Analysis of Parameterized Loop Nests for Direct Mapped Data Cache. IEEE Trans. Computers 54(2): 185-197 (2005) - [c6]Paolo D'Alberto, Alexandru Nicolau:
Using Recursion to Boost ATLAS's Performance. ISHPC 2005: 142-151 - 2004
- [c5]Arun Kejariwal, Paolo D'Alberto, Alexandru Nicolau, Constantine D. Polychronopoulos:
A Geometric Approach for Partitioning N-Dimensional Non-rectangular Iteration Spaces. LCPC 2004: 102-116 - [c4]Paolo D'Alberto, Alexandru Nicolau:
JuliusC: A Practical Approach for the Analysis of Divide-and-Conquer Algorithms. LCPC 2004: 117-131 - 2003
- [c3]Paolo D'Alberto, Alexandru Nicolau, Alexander V. Veidenbaum:
A Data Cache with Dynamic Mapping. LCPC 2003: 436-450 - 2001
- [c2]Gianfranco Bilardi, Paolo D'Alberto, Alexandru Nicolau:
Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance. WAE 2001: 26-38 - 2000
- [c1]Gianfranco Bilardi, Andrea Pietracaprina, Paolo D'Alberto:
On the Space and Access Complexity of Computation DAGs. WG 2000: 47-58
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-16 18:25 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:
