Výsledky vyhľadávania - "streaming algorithms"
-
1
Randomized counter-based algorithms for frequency estimation over data streams in O ( log log N ) space
ISSN: 0304-3975Vydavateľské údaje: 12.02.2024Vydané v Theoretical computer science (12.02.2024)Získať plný text
Journal Article -
2
Sparse Recovery Using Sparse Matrices
ISSN: 0018-9219, 1558-2256Vydavateľské údaje: New York IEEE 01.06.2010Vydané v Proceedings of the IEEE (01.06.2010)“…In this paper, we survey algorithms for sparse recovery problems that are based on sparse random matrices. Such matrices has several attractive properties:…”
Získať plný text
Journal Article -
3
A distributed streaming framework for edge–cloud triangle counting in graph streams
ISSN: 0950-7051, 1872-7409Vydavateľské údaje: Elsevier B.V 25.10.2023Vydané v Knowledge-based systems (25.10.2023)“…The triangle counting problem in graph streams has been extensively studied in social network analysis, recommendation systems, user portraits and other…”
Získať plný text
Journal Article -
4
Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice
ISSN: 0304-3975, 1879-2294Vydavateľské údaje: Elsevier B.V 18.11.2022Vydané v Theoretical computer science (18.11.2022)“…The study of non-submodular maximization on the integer lattice is an important extension of submodular optimization. In this paper, streaming algorithms for…”
Získať plný text
Journal Article -
5
Fast shared-memory streaming multilevel graph partitioning
ISSN: 0743-7315, 1096-0848Vydavateľské údaje: United States Elsevier Inc 01.01.2021Vydané v Journal of parallel and distributed computing (01.01.2021)“…A fast parallel graph partitioner can benefit many applications by reducing data transfers. The online methods for partitioning graphs have to be fast and they…”
Získať plný text
Journal Article -
6
ProbMinHash - A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity
ISSN: 1041-4347, 1558-2191Vydavateľské údaje: New York IEEE 01.07.2022Vydané v IEEE transactions on knowledge and data engineering (01.07.2022)“…The probability Jaccard similarity was recently proposed as a natural generalization of the Jaccard similarity to measure the proximity of sets whose elements…”
Získať plný text
Journal Article -
7
Two-way and one-way quantum and classical automata with advice for online minimization problems
ISSN: 0304-3975, 1879-2294Vydavateľské údaje: Elsevier B.V 12.06.2022Vydané v Theoretical computer science (12.06.2022)“…We consider online algorithms. Typically, the model is investigated with respect to the competitive ratio. In this paper, we explore two-way automata and…”
Získať plný text
Journal Article -
8
JACC-FPGA: A hardware accelerator for Jaccard similarity estimation using FPGAs in the cloud
ISSN: 0167-739X, 1872-7115Vydavateľské údaje: Elsevier B.V 01.01.2023Vydané v Future generation computer systems (01.01.2023)“…Genomic similarity is a key metric in genomics, used in important tasks such as genome clustering and metagenomic profiling. One commonly-used approach is to…”
Získať plný text
Journal Article -
9
Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity
ISSN: 0304-3975, 1879-2294Vydavateľské údaje: Elsevier B.V 15.06.2023Vydané v Theoretical computer science (15.06.2023)“…We study the problem of minimizing total completion time on parallel machines subject to varying processing capacity. In this paper, we develop an…”
Získať plný text
Journal Article -
10
Sparsifying Count Sketch
ISSN: 0020-0190, 1872-6119Vydavateľské údaje: Elsevier B.V 01.08.2024Vydané v Information processing letters (01.08.2024)“…The seminal work of Charikar et al. [1] called Count-Sketch suggests a sketching algorithm for real-valued vectors that has been used in frequency estimation…”
Získať plný text
Journal Article -
11
Interactive Exploration and Analysis of Large-Scale Simulations Using Topology-Based Data Segmentation
ISSN: 1077-2626, 1941-0506, 1941-0506Vydavateľské údaje: United States IEEE 01.09.2011Vydané v IEEE transactions on visualization and computer graphics (01.09.2011)“…Large-scale simulations are increasingly being used to study complex scientific and engineering phenomena. As a result, advanced visualization and data…”
Získať plný text
Journal Article -
12
A streaming algorithm and hardware accelerator to estimate the empirical entropy of network flows
ISSN: 1389-1286, 1872-7069Vydavateľské údaje: Elsevier B.V 01.12.2023Vydané v Computer networks (Amsterdam, Netherlands : 1999) (01.12.2023)“…The empirical entropy is used in network traffic monitoring and classification to detect anomalous events and manage network resources. Computing the entropy…”
Získať plný text
Journal Article -
13
Online Learning From Evolving Feature Spaces With Deep Variational Models
ISSN: 1041-4347, 1558-2191Vydavateľské údaje: New York IEEE 01.08.2024Vydané v IEEE transactions on knowledge and data engineering (01.08.2024)“…In this paper, we explore a novel online learning setting, where the online learners are presented with "doubly-streaming" data. Namely, the data instances…”
Získať plný text
Journal Article -
14
MOSES: A Streaming Algorithm for Linear Dimensionality Reduction
ISSN: 0162-8828, 1939-3539, 2160-9292, 1939-3539Vydavateľské údaje: United States IEEE 01.11.2020Vydané v IEEE transactions on pattern analysis and machine intelligence (01.11.2020)“…This paper introduces Memory-limited Online Subspace Estimation Scheme (MOSES) for both estimating the principal components of streaming data and reducing its…”
Získať plný text
Journal Article -
15
An Improved Frequent Directions Algorithm for Low-Rank Approximation via Block Krylov Iteration
ISSN: 2162-237X, 2162-2388, 2162-2388Vydavateľské údaje: United States IEEE 01.07.2024Vydané v IEEE transaction on neural networks and learning systems (01.07.2024)“…Frequent directions (FDs), as a deterministic matrix sketching technique, have been proposed for tackling low-rank approximation problems. This method has a…”
Získať plný text
Journal Article -
16
Streaming Algorithms for Estimating High Set Similarities in LogLog Space
ISSN: 1041-4347, 1558-2191Vydavateľské údaje: New York IEEE 01.10.2021Vydané v IEEE transactions on knowledge and data engineering (01.10.2021)“…Estimating set similarity and detecting highly similar sets are fundamental problems in areas such as databases and machine learning. MinHash is a well-known…”
Získať plný text
Journal Article -
17
Fast shared-memory streaming multilevel graph partitioning
ISSN: 0743-7315, 1096-0848Vydavateľské údaje: United States Elsevier 12.09.2020Vydané v Journal of parallel and distributed computing (12.09.2020)“…In this report we show that a fast parallel graph partitioner can benefit many applications by reducing data transfers. The online methods for partitioning…”
Získať plný text
Journal Article -
18
Least-Mean-Squares Coresets for Infinite Streams
ISSN: 1041-4347, 1558-2191Vydavateľské údaje: New York IEEE 01.09.2023Vydané v IEEE transactions on knowledge and data engineering (01.09.2023)“…Consider a stream of <inline-formula><tex-math notation="LaTeX">d</tex-math> <mml:math><mml:mi>d</mml:mi></mml:math><inline-graphic…”
Získať plný text
Journal Article -
19
Near Optimal Linear Algebra in the Online and Sliding Window Models
ISSN: 2575-8454, 2575-8454Vydavateľské údaje: IEEE 01.01.2020Vydané v Proceedings / annual Symposium on Foundations of Computer Science (01.01.2020)“…We initiate the study of numerical linear algebra in the sliding window model, where only the most recent W updates in a stream form the underlying data set…”
Získať plný text
Konferenčný príspevok.. Journal Article -
20
Optimal Streaming Approximations for all Boolean Max-2CSPs and Max-ksat
ISSN: 2575-8454Vydavateľské údaje: IEEE 01.11.2020Vydané v Proceedings / annual Symposium on Foundations of Computer Science (01.11.2020)“…We prove tight upper and lower bounds on approximation ratios of all Boolean Max-2CSP problems in the streaming model. Specifically, for every type of Max-2CSP…”
Získať plný text
Konferenčný príspevok..