Výsledky vyhľadávania - Read-only memory algorithms

Upresniť hľadanie
  1. 1

    Adaptive Threshold Read Algorithms in Multi-Level Non-Volatile Memories Autor Hemo, Evyatar, Cassuto, Yuval

    ISSN: 0733-8716, 1558-0008
    Vydavateľské údaje: New York IEEE 01.05.2014
    “… We further adapt the read algorithms to the case where the cell levels are not uniformly distributed, as motivated by partially-erased memory arrays…”
    Získať plný text
    Journal Article
  2. 2

    Channel Parameter and Read Reference Voltages Estimation in 3-D NAND Flash Memory Using Unsupervised Learning Algorithms Autor Hu, Haihua, Han, Guojun, Wu, Wenhua, Liu, Chang

    ISSN: 0278-0070, 1937-4151
    Vydavateľské údaje: New York IEEE 01.01.2024
    “…, which becomes a new challenge. To tackle this problem, two unsupervised learning algorithms are proposed to estimate the channel parameters, based on analyzing the error distribution in 3-D flash memory…”
    Získať plný text
    Journal Article
  3. 3

    Read Algorithm for Memory Device

    Vydavateľské údaje: Washington, D.C Targeted News Service 09.01.2024
    Vydané v Targeted News Service (09.01.2024)
    Získať plný text
    Newsletter
  4. 4

    Read Algorithm for Memory Device

    Vydavateľské údaje: Washington, D.C Targeted News Service 13.12.2022
    Vydané v Targeted News Service (13.12.2022)
    Získať plný text
    Newsletter
  5. 5
  6. 6

    Prune-and-search with limited workspace Autor De, Minati, Nandy, Subhas C., Roy, Sasanka

    ISSN: 0022-0000, 1090-2724
    Vydavateľské údaje: Elsevier Inc 01.03.2015
    “… We consider both the in-place and read-only model which have several advantages compared to the traditional model of computation…”
    Získať plný text
    Journal Article
  7. 7

    PLEDGER: Embedded Whole Genome Read Mapping using Algorithm-HW Co-design and Memory-aware Implementation Autor Maheshwari, Sidharth, Shafik, Rishad, Wilson, Ian, Yakovlev, Alex, Gudur, Venkateshwarlu Y., Acharyya, Amit

    ISSN: 1558-1101
    Vydavateľské údaje: EDAA 01.02.2021
    “… In this paper, we propose an algorithm-hardware co-design driven acceleration approach for enabling translational genomics…”
    Získať plný text
    Konferenčný príspevok..
  8. 8

    LightAssembler: fast and memory-efficient assembly algorithm for high-throughput sequencing reads Autor El-Metwally, Sara, Zakaria, Magdi, Hamza, Taher

    ISSN: 1367-4803, 1367-4811, 1367-4811
    Vydavateľské údaje: England 01.11.2016
    Vydané v Bioinformatics (Oxford, England) (01.11.2016)
    “… it. With error prone high throughput NGS reads and genomic repeats, the assembly graph contains massive amount of redundant nodes and branching edges…”
    Získať plný text
    Journal Article
  9. 9
  10. 10
  11. 11
  12. 12

    Finding median in read-only memory on integer input Autor Chan, Timothy M., Munro, J. Ian, Raman, Venkatesh

    ISSN: 0304-3975, 1879-2294
    Vydavateľské údaje: Elsevier B.V 07.06.2015
    Vydané v Theoretical computer science (07.06.2015)
    “… We show that faster selection algorithms in read-only memory are possible if the input is a sequence of integers…”
    Získať plný text
    Journal Article
  13. 13

    Cyclic memory: a low-latency, single-buffer technique for FMCW LiDAR interleaving/de-interleaving Autor Hafez, O. S., Abouelfetouh, O. A., Mohamed, Y. O., Hasaneen, M. N., Fathy, O. H., Hassan, Y. H., Mahroos, M. M., Elomda, R. A., Ghouneem, M. M.

    ISSN: 0925-1030, 1573-1979
    Vydavateľské údaje: New York Springer US 01.09.2025
    “… This idea increases memory data throughput by not halting the pipeline operation. This paper presents a memory read/write algorithm called “Cyclic Memory…”
    Získať plný text
    Journal Article
  14. 14

    Read Algorithms for Three-Dimensional Crosspoint Memory Architectures

    Vydavateľské údaje: Washington, D.C Targeted News Service 15.10.2024
    Vydané v Targeted News Service (15.10.2024)
    Získať plný text
    Newsletter
  15. 15

    Modeling and Analysis of Dekker-Based Mutual Exclusion Algorithms Autor Nigro, Libero, Cicirelli, Franco, Pupo, Francesco

    ISSN: 2073-431X, 2073-431X
    Vydavateľské údaje: Basel MDPI AG 01.06.2024
    Vydané v Computers (Basel) (01.06.2024)
    “… Dekker and communicated by E.W. Dijkstra. The correctness of this algorithm has generally been studied under the strong memory model, where the read and write operations on a memory cell are atomic or indivisible…”
    Získať plný text
    Journal Article
  16. 16

    DLBF: A low overhead wear leveling algorithm for embedded systems with hybrid memory Autor Niu, Na, Fu, Fangfa, Yang, Bing, Wang, Qiang, Yuan, Jiacai, Lai, Fengchang, Zhao, Xinyu, Zhang, Zhewen, Wang, Jinxiang

    ISSN: 0026-2714, 1872-941X
    Vydavateľské údaje: Elsevier Ltd 01.08.2021
    Vydané v Microelectronics and reliability (01.08.2021)
    “… However, relatively lower endurance has limited its practical application. Discussions regarding hybrid memory wear leveling algorithms have dominated research dereliction in recent years…”
    Získať plný text
    Journal Article
  17. 17

    AlignS: A Processing-In-Memory Accelerator for DNA Short Read Alignment Leveraging SOT-MRAM Autor Angizi, Shaahin, Sun, Jiao, Zhang, Wei, Fan, Deliang

    Vydavateľské údaje: ACM 01.06.2019
    “…) is proposed to execute DNA short read alignment based on an optimized and hardware-friendly alignment algorithm…”
    Získať plný text
    Konferenčný príspevok..
  18. 18

    GRIM-Filter: Fast seed location filtering in DNA read mapping using processing-in-memory technologies Autor Kim, Jeremie S., Senol Cali, Damla, Xin, Hongyi, Lee, Donghyuk, Ghose, Saugata, Alser, Mohammed, Hassan, Hasan, Ergin, Oguz, Alkan, Can, Mutlu, Onur

    ISSN: 1471-2164, 1471-2164
    Vydavateľské údaje: London BioMed Central 09.05.2018
    Vydané v BMC genomics (09.05.2018)
    “…) check similarity between each read and its associated reference sequences with a computationally-expensive algorithm (i.e…”
    Získať plný text
    Journal Article
  19. 19

    Memory-Hazard-Aware K-Buffer Algorithm for Order-Independent Transparency Rendering Autor Zhang, Nan

    ISSN: 1077-2626, 1941-0506, 1941-0506
    Vydavateľské údaje: United States IEEE 01.02.2014
    “… Because of the inherent massive parallelism of GPU stream processors, this algorithm suffers serious read-after-write memory hazards now…”
    Získať plný text
    Journal Article
  20. 20