Results 1 to 10 of about 10,943 (115)
Performance analysis of a hardware accelerator of dependence management for taskbased dataflow programming models [PDF]
, 2016 Along with the popularity of multicore and manycore, task-based dataflow programming models obtain great attention for being able to extract high parallelism from applications without exposing the complexity to programmers.
Ayguadé Parra, Eduard +5 more
core +1 more source
Simple, compact and robust approximate string dictionary [PDF]
, 2014 This paper is concerned with practical implementations of approximate string dictionaries that allow edit errors. In this problem, we have as input a dictionary $D$ of $d$ strings of total length $n$ over an alphabet of size $\sigma$.
Belazzougui, Djamal, Chegrane, Ibrahim
core +1 more source
A comprehensive evaluation of alignment algorithms in the context of RNA-seq. [PDF]
, 2012 Transcriptome sequencing (RNA-Seq) overcomes limitations of previously used RNA quantification methods and provides one experimental framework for both high-throughput characterization and quantification of transcripts at the nucleotide level.
Friedel, Caroline C., Lindner, Robert
core +3 more sources
Exploiting the Synergy Between Gossiping and Structured Overlays [PDF]
, 2007 In this position paper we argue for exploiting the synergy between gossip-based algorithms and structured overlay networks (SON). These two strands of research have both aimed at building fault-tolerant, dynamic, self-managing, and large-scale ...
Ali Ghodsi +13 more
core +2 more sources
Handling Massive N-Gram Datasets Efficiently [PDF]
, 2018 This paper deals with the two fundamental problems concerning the handling of large n-gram language models: indexing, that is compressing the n-gram strings and associated satellite data without compromising their retrieval speed; and estimation, that is
Pibiri, Giulio Ermanno +1 more
core +3 more sources
DiBELLA: Distributed long read to long read alignment [PDF]
, 2019 We present a parallel algorithm and scalable implementation for genome analysis, specifically the problem of finding overlaps and alignments for data from "third generation" long read sequencers [29]. While long sequences of DNA offer enormous advantages
Buluç, A +4 more
core +2 more sources
Scalable and Sustainable Deep Learning via Randomized Hashing
, 2016 Current deep learning architectures are growing larger in order to learn from complex datasets. These architectures require giant matrix multiplication operations to train millions of parameters.
Chen Wenlin +8 more
core +1 more source
Compact Environment-Invariant Codes for Robust Visual Place Recognition
, 2017 Robust visual place recognition (VPR) requires scene representations that are invariant to various environmental challenges such as seasonal changes and variations due to ambient lighting conditions during day and night.
Jain, Unnat +2 more
core +1 more source
Weighted ancestors in suffix trees [PDF]
, 2014 The classical, ubiquitous, predecessor problem is to construct a data structure for a set of integers that supports fast predecessor queries. Its generalization to weighted trees, a.k.a.
D.E. Willard +6 more
core +1 more source
, 2004 We introduce two dual, purely quantum protocols: for entanglement distillation assisted by quantum communication (``mother'' protocol) and for entanglement assisted quantum communication (``father'' protocol).
Devetak, I., Harrow, A. W., Winter, A.
core +1 more source