default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichele Franceschini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c25]Matthew Riemer, Tim Klinger, Djallel Bouneffouf, Michele Franceschini:
Scalable Recollections for Continual Lifelong Learning. AAAI 2019: 1352-1359- 2017
- [i3]Matthew Riemer, Michele Franceschini, Tim Klinger:
Generation and Consolidation of Recollections for Efficient Deep Lifelong Learning. CoRR abs/1711.06761 (2017) - 2016
- [c24]Michele M. Franceschini, Livio B. Soares, Luis Alfonso Lastras-Montaño:
Watson Concept Insights: A Conceptual Association Framework. WWW (Companion Volume) 2016: 179-182 - 2014
- [j8]Ramji Venkataramanan, Sekhar Tatikonda, Luis Lastras-Monta, Michele Franceschini:
Rewritable Storage Channels with Hidden State. IEEE J. Sel. Areas Commun. 32(5): 815-824 (2014) - [j7]Andrea Abrardo, Gianluigi Ferrari
, Marco Martalò, Michele Franceschini, Riccardo Raheli:
Orthogonal Multiple Access With Correlated Sources: Achievable Region and Pragmatic Schemes. IEEE Trans. Commun. 62(7): 2531-2543 (2014) - [j6]Luis Alfonso Lastras-Montaño, Michele Franceschini, Thomas Mittelholzer, Mayank Sharma:
On the Capacity of Memoryless Rewritable Storage Channels. IEEE Trans. Inf. Theory 60(6): 3178-3195 (2014) - [c23]Felix Schürmann, Fabien Delalondre, Pramod S. Kumbhar, John Biddiscombe, Miguel Gila, Davide Tacchella, Alessandro Curioni, Bernard Metzler, Peter Morjan, Joachim Fenkes, Michele Franceschini, Robert S. Germain, Lars Schneidenbach, T. J. Christopher Ward, Blake G. Fitch:
Rebasing I/O for Scientific Computing: Leveraging Storage Class Memory in an IBM BlueGene/Q Supercomputer. ISC 2014: 331-347 - 2012
- [c22]Augusto Vega, Pradip Bose, Alper Buyuktosunoglu, Jeff H. Derby, Michele Franceschini, Charles Johnson, Robert K. Montoye:
Architectural perspectives of future wireless base stations based on the IBM PowerEN™ processor. HPCA 2012: 423-432 - [c21]Moinuddin K. Qureshi, Michele Franceschini, Ashish Jagmohan, Luis A. Lastras:
PreSET: Improving performance of phase change memories by exploiting asymmetry in write times. ISCA 2012: 380-391 - [c20]Ramji Venkataramanan, Sekhar Tatikonda, Luis Alfonso Lastras-Montaño, Michele Franceschini:
Coding strategies for the uniform noise rewritable channel with hidden state. ISIT 2012: 1005-1009 - [i2]Andrea Abrardo, Gianluigi Ferrari, Marco Martalò, Michele Franceschini, Riccardo Raheli:
Orthogonal Multiple Access with Correlated Sources: Feasible Region and Pragmatic Schemes. CoRR abs/1201.6548 (2012) - [i1]Ramji Venkataramanan, Sekhar Tatikonda, Luis A. Lastras, Michele Franceschini:
Coding strategies for the uniform noise rewritable channel with hidden state. CoRR abs/1206.2491 (2012) - 2011
- [c19]Moinuddin K. Qureshi, André Seznec, Luis A. Lastras, Michele Franceschini:
Practical and secure PCM systems by online detection of malicious write streams. HPCA 2011: 478-489 - 2010
- [c18]Moinuddin K. Qureshi, Michele Franceschini, Luis Alfonso Lastras-Montaño:
Improving read performance of Phase Change Memories via Write Cancellation and Write Pausing. HPCA 2010: 1-11 - [c17]Michele Franceschini, Luis Alfonso Lastras-Montaño, Ashish Jagmohan, Mayank Sharma, Roger Cheek, M.-H. Lee:
A Communication-Theoretic Approach to Phase Change Storage. ICC 2010: 1-6 - [c16]Ashish Jagmohan, Luis Alfonso Lastras-Montaño, Michele Franceschini, Mayank Sharma, Roger Cheek:
Coding for Multilevel Heterogeneous Memories. ICC 2010: 1-6 - [c15]Moinuddin K. Qureshi, Michele Franceschini, Luis Alfonso Lastras-Montaño, John P. Karidis:
Morphable memory system: a robust architecture for exploiting multi-level phase change memories. ISCA 2010: 153-162 - [c14]Luis Alfonso Lastras-Montaño, Michele Franceschini, Thomas Mittelholzer:
The capacity of the uniform noise rewritable channel with average cost. ISIT 2010: 201-205 - [c13]Luis Alfonso Lastras-Montaño, Ashish Jagmohan, Michele Franceschini:
Algorithms for memories with stuck cells. ISIT 2010: 968-972 - [c12]Thomas Mittelholzer, Luis Alfonso Lastras-Montaño, Mayank Sharma, Michele Franceschini:
Rewritable storage channels with limited number of rewrite iterations. ISIT 2010: 973-977 - [c11]Luis Alfonso Lastras-Montaño, Michele Franceschini, Bipin Rajendran, C. Lam:
Coding for sensing in Content Addressable Memories. ISIT 2010: 1923-1927 - [c10]Michele Franceschini, Luis Alfonso Lastras-Montaño, John P. Karidis, Ashish Jagmohan:
Information theory based design of phase-change memories. ITA 2010: 119-125 - [c9]L. A. Lastras-Montao, Thomas Mittelholzer, Michele Franceschini:
Superposition coding in rewritable channels. ITA 2010: 245-253 - [c8]Marco Martalò, Gianluigi Ferrari, Andrea Abrardo, Michele Franceschini, Riccardo Raheli:
Density evolution-based analysis and design of LDPC codes with a priori information. ITA 2010: 308-316 - [c7]Ashish Jagmohan, Michele Franceschini, Luis A. Lastras:
Write amplification reduction in NAND Flash through multi-write coding. MSST 2010: 1-6
2000 – 2009
- 2009
- [j5]Michele Franceschini, Luis Alfonso Lastras-Montaño, Thomas Mittelholzer, Mayank Sharma:
The role of feedback in rewritable storage channels [Lecture Notes]. IEEE Signal Process. Mag. 26(6): 190-222 (2009) - [j4]Riccardo Pighi, Michele Franceschini, Gianluigi Ferrari, Riccardo Raheli:
Fundamental performance limits of communications systems impaired by impulse noise. IEEE Trans. Commun. 57(1): 171-182 (2009) - [j3]Michele Franceschini, Gianluigi Ferrari, Riccardo Raheli:
Detection by multiple trellises. IEEE Trans. Commun. 57(3): 726-737 (2009) - [c6]Thomas Mittelholzer, Michele Franceschini, Luis Alfonso Lastras-Montaño, Ibrahim M. Elfadel, Mayank Sharma:
Rewritable Channels With Data-Dependent Noise. ICC 2009: 1-6 - [c5]Luis Alfonso Lastras-Montaño, Michele Franceschini, Thomas Mittelholzer, John P. Karidis, Mark N. Wegman:
On the lifetime of multilevel memories. ISIT 2009: 1224-1228 - [c4]Moinuddin K. Qureshi, John P. Karidis, Michele Franceschini, Vijayalakshmi Srinivasan, Luis A. Lastras, Bülent Abali:
Enhancing lifetime and security of PCM-based main memory with start-gap wear leveling. MICRO 2009: 14-23 - 2006
- [j2]Michele Franceschini, Gianluigi Ferrari, Riccardo Raheli:
Does the Performance of LDPC Codes Depend on the Channel? IEEE Trans. Commun. 54(12): 2129-2132 (2006) - 2005
- [j1]Michele Franceschini, Gianluigi Ferrari, Riccardo Raheli, Aldo Curtoni:
Serial concatenation of LDPC codes and differential modulations. IEEE J. Sel. Areas Commun. 23(9): 1758-1768 (2005) - [c3]Michele Franceschini, Gianluigi Ferrari, Riccardo Raheli:
High-SNR mutual information of dense constellations. GLOBECOM 2005: 5 - [c2]Michele Franceschini, Gianluigi Ferrari, Riccardo Raheli, Aldo Curtoni:
A novel class of low-complexity SISO algorithms for phase-uncertain communications. ISIT 2005: 363-367 - [c1]Gianluigi Ferrari, Michele Franceschini, Riccardo Raheli, Massimiliano Bellini:
A low-complexity DQPSK detection algorithm for fading channels. ISWCS 2005: 190-194
Coauthor Index
aka: Luis Alfonso Lastras-Montaño
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-04-24 23:16 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:
