13 papers · ranked by Valyu relevance
Hossein Shafiei, Aresh Dadlani
Online social networks have attracted billions of active users over the past decade. These systems play an integral role in the everyday life of many people around the world. As such, these platforms are also attractive for misinformation, hoaxes, and fake news campaigns which usually utilize social trolls and/or…
Suluk Chaikhan, Suphakant Phimoltares, Chidchanok Lursinsap, Mohamed Hammad
'Mohamed Hammad'] Big streaming data environment concerns a complicated scenario where data to be processed continuously flow into a processing unit and certainly cause a memory overflow problem. This obstructs the adaptation of deploying all existing classic sorting algorithms because the data to be sorted must be…
Giulio Ermanno Pibiri, Rob Patro
Representing a set of k-mers — strings of length k — in small space under fast lookup queries is a fundamental requirement for several applications in Bioinformatics. A data structure based on sparse and skew hashing (SSHash) was recently proposed for this purpose [23]: it combines good space effectiveness with fast…
Benjamin Parks, William Greenleaf
The growth of single-cell datasets to multi-million cell atlases has uncovered major scalability problems for single-cell analysis software. Here, we present BPCells, a package for high-performance single-cell analysis of RNA-seq and ATAC-seq datasets. BPCells uses disk-backed streaming compute algorithms to reduce…
Jiaqi Liu, Qiwu Wu, Lingzhi Jiang, Renjun Zhan + 4 more
'Husheng Wu' 'Weicong Tan' 'Jianchao Bai'] Tensor data is common in real-world applications, such as recommendation system and air quality monitoring. But such data is often sparse, noisy, and fast produced. CANDECOMP/PARAFAC (CP) is a popular tensor decomposition model, which is both theoretically advantageous and…
Oswaldo Cadenas, Jiapeng Liu
Convex hull computation on large planar point sets is commonly preceded by geometric filtering to reduce input size. Motivated by invariants used in incremental convex hull maintenance, we derive a streaming, certificate-based reduction that discards only points certified interior to the hull. We show that the…
Paritosh Garg, Linus Jordan, Ola Svensson
While the basic greedy algorithm gives a semi-streaming algorithm with an approximation guarantee of 2 for the unweighted matching problem, it was only recently that Paz and Schwartzman obtained an analogous result for weighted instances. Their approach is based on the versatile local ratio technique and also applies…
Rick Beeloo, Ragnar Groot Koerkamp
Approximate string matching (ASM) is the problem of finding all occurrences of a pattern in a text while allowing up to k errors. Many modern methods use seed-chain-extend, which is fast in practice, but does not guarantee finding all matches with ≤ k errors. However, applications such as CRISPR off-target detection…
Jamshed Khan, Rob Patro, Prashant Pandey
Hash tables are fundamental to computational genomics, where keys are often k-mers—fixed-length substrings that exhibit a “streaming” property: consecutive k-mers share k−1 nucleotides and are processed in order. Existing static data structures exploit this locality but cannot support dynamic updates, while…
Pengju Zhou, Vicente Alarcon-Aquino
Cybersecurity has always been a subject of great concern, and anomaly detection has gained increasing attention due to its ability to detect novel attacks. However, network anomaly detection faces significant challenges when dealing with massive traffic, logs, and other forms of streaming data. This article provides a…
Ragnar Groot Koerkamp, Giulio Ermanno Pibiri
Given a string S, a minimizer scheme is an algorithm defined by a triple (k, w, 𝒪) that samples a subset of k-mers (k-long substrings) from a string S. Specifically, it samples the smallest k-mer according to the order 𝒪 from each window of w consecutive k-mers in S. Because consecutive windows can sample the same…
Chongdeuk Lee, Francisco Cercas, Rui Dinis, Nuno Souto
To provide high-quality streaming services in device-to-device (D2D) communications, performance parameters such as encoding rate, decoding rate, and flow rate should be detected and monitored. The proposed algorithm provides a method to detect time streaming for traffic flows in D2D communications, and a sequence to…
Christian Kothe, Seyed Yahya Shirazi, Tristan Stenner, David Medine + 6 more
Accurately recording the interactions of humans or other organisms with their environment and other agents requires synchronized data access via multiple instruments, often running independently using different clocks. Active, hardware-mediated solutions are often infeasible or prohibitively costly to build and run…