On the public citation graph
Optimal sampling from sliding windows
0 signed · 132 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jcss.1997.1534openalex-snapshot
Size-Estimation Framework with Applications to Transitive Closure and Reachability
inferredcites →https://doi.org/10.1007/11533719_72openalex-snapshot
New Streaming Algorithms for Counting Triangles in Graphs
inferredcites →https://doi.org/10.1007/11535331_7openalex-snapshot
Density Estimation for Spatial Data Streams
inferredcites →https://doi.org/10.1007/11672142_15openalex-snapshot
Estimating Entropy and Entropy Norm on Data Streams
inferredcites →https://doi.org/10.1007/11818175_12openalex-snapshot
When Random Sampling Preserves Privacy
inferredcites →https://doi.org/10.1007/3-540-45726-7_1openalex-snapshot
Counting Distinct Elements in a Data Stream
inferredcites →https://doi.org/10.1007/3-540-45749-6_31openalex-snapshot
Estimating Rarity and Similarity over Data Stream Windows
inferredcites →https://doi.org/10.1007/978-0-387-47534-9openalex-snapshot
Data Streams: Models and Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-27821-4_33openalex-snapshot
Estimating Frequency Moments of Data Streams Using Random Linear Combinations
inferredcites →https://doi.org/10.1007/978-3-540-28608-0_16openalex-snapshot
STREAM: The Stanford Data Stream Management System
inferredcites →https://doi.org/10.1007/s00453-002-0959-4openalex-snapshot
Testing and Spot-Checking of Data Streams
inferredcites →https://doi.org/10.1007/s00453-004-1105-2openalex-snapshot
Computing Diameter in the Streaming and Sliding-Window Models
inferredcites →https://doi.org/10.1007/s00778-004-0132-6openalex-snapshot
Operator scheduling in data stream systems
inferredcites →https://doi.org/10.1016/b978-012722442-8/50051-3openalex-snapshot
Processing Sliding Window Multi-Joins in Continuous Queries over Data Streams
inferredcites →https://doi.org/10.1016/b978-155860869-6/50037-8openalex-snapshot
Comparing Data Streams Using Hamming Norms (How to Zero In)
inferredcites →https://doi.org/10.1016/j.jcss.2003.11.006openalex-snapshot
An information statistics approach to data stream and communication complexity
inferredcites →https://doi.org/10.1016/j.tcs.2005.09.013openalex-snapshot
On graph problems in a semi-streaming model
inferredcites →https://doi.org/10.1016/j.tcs.2007.02.031openalex-snapshot
Counting distinct items over update streams
inferredcites →https://doi.org/10.1109/ccc.2003.1214414openalex-snapshot
Near-optimal lower bounds on the multi-party communication complexity of set disjointness
inferredcites →https://doi.org/10.1109/focs.2007.4389500openalex-snapshot
Smooth Histograms for Sliding Windows
inferredcites →https://doi.org/10.1109/focs.2007.63openalex-snapshot
Intrusion-Resilient Secret Sharing
inferredcites →https://doi.org/10.1109/focs.2008.76openalex-snapshot
Sketching and Streaming Entropy via Approximation Theory
inferredcites →https://doi.org/10.1109/icde.2004.1320010openalex-snapshot
Load shedding for aggregation queries over data streams
inferredcites →https://doi.org/10.1109/icdm.2004.10084openalex-snapshot
Moment: Maintaining Closed Frequent Itemsets over a Stream Sliding Window
inferredcites →https://doi.org/10.1109/sfcs.2002.1181944openalex-snapshot
An information statistics approach to data stream and communication complexity
inferredcites →https://doi.org/10.1109/tkde.2003.1198387openalex-snapshot
Clustering data streams: theory and practice
inferredcites →https://doi.org/10.1109/tkde.2005.17openalex-snapshot
Semantic approximation of data stream joins
inferredcites →https://doi.org/10.1137/070696507openalex-snapshot
Sampling Algorithms and Coresets for $\ell_p$ Regression
inferredcites →https://doi.org/10.1137/1.9781611972757.5openalex-snapshot
Summarizing and Mining Skewed Data Streams
inferredcites →https://doi.org/10.1137/s0097539701398363openalex-snapshot
Maintaining Stream Statistics over Sliding Windows
inferredcites →https://doi.org/10.1137/s0097539702418498openalex-snapshot
Incremental Clustering and Dynamic Information Retrieval
inferredcites →https://doi.org/10.1142/9789812701534_0129openalex-snapshot
RANDOM SAMPLING ALGORITHMS FOR SLIDING WINDOWS OVER DATA STREAMS
inferredcites →https://doi.org/10.1145/1005686.1005699openalex-snapshot
Flow sampling under hard resource constraints
inferredcites →https://doi.org/10.1145/1007568.1007616openalex-snapshot
Static optimization of conjunctive queries with sliding windows over infinite streams
inferredcites →https://doi.org/10.1145/1012888.1005699openalex-snapshot
Flow sampling under hard resource constraints
inferredcites →https://doi.org/10.1145/1055558.1055598openalex-snapshot
Approximate counts and quantiles over sliding windows
inferredcites →https://doi.org/10.1145/1060590.1060621openalex-snapshot
Optimal approximations of the frequency moments of data streams
inferredcites →https://doi.org/10.1145/1064092.1064116openalex-snapshot
Sampling in dynamic data streams and applications
inferredcites →https://doi.org/10.1145/1065167.1065209openalex-snapshot
Estimating arbitrary subset sums with few probes
inferredcites →https://doi.org/10.1145/1066157.1066193openalex-snapshot
Semantics and evaluation techniques for window aggregates in data streams
inferredcites →https://doi.org/10.1145/1109557.1109634openalex-snapshot
Simpler algorithm for estimating frequency moments of data streams
inferredcites →https://doi.org/10.1145/1109557.1109636openalex-snapshot
Maintaining significant stream statistics over sliding windows
inferredcites →https://doi.org/10.1145/1109557.1109637openalex-snapshot
Streaming and sublinear approximation of entropy and information distances
inferredcites →https://doi.org/10.1145/1132516.1132539openalex-snapshot
The DLT priority sampling is essentially optimal
inferredcites →https://doi.org/10.1145/1141885.1141891openalex-snapshot
Sequential reservoir sampling with a nonuniform distribution
inferredcites →https://doi.org/10.1145/1142351.1142388openalex-snapshot
Counting triangles in data streams
inferredcites →https://doi.org/10.1145/1281100.1281133openalex-snapshot
Summarizing data using bottom-k sketches
inferredcites →https://doi.org/10.1145/1298306.1298345openalex-snapshot
A data streaming algorithm for estimating entropies of od flows
inferredcites →https://doi.org/10.1145/1376616.1376657openalex-snapshot
Sampling time-based sliding windows in bounded space
inferredcites →https://doi.org/10.1145/198429.198435openalex-snapshot
Reservoir-sampling algorithms of time complexity O ( n (1 + log( N / n )))
inferredcites →https://doi.org/10.1145/237814.237823openalex-snapshot
The space complexity of approximating the frequency moments
inferredcites →https://doi.org/10.1145/276304.276334openalex-snapshot
New sampling-based summary statistics for improving approximate query answers
inferredcites →https://doi.org/10.1145/543613.543615openalex-snapshot
Models and issues in data stream systems
inferredcites →https://doi.org/10.1145/564870.564880openalex-snapshot
Distributed streams algorithms for sliding windows
inferredcites →https://doi.org/10.1145/773153.773176openalex-snapshot
Maintaining variance and k-medians over data stream windows
inferredcites →https://doi.org/10.1145/780542.780593openalex-snapshot
Sampling lower bounds via information theory
inferredcites →https://doi.org/10.1145/948205.948227openalex-snapshot
Identifying frequent items in sliding windows over on-line packet streams
inferredcites →https://doi.org/10.14778/2367502.2367508openalex-snapshot
Approximate frequency counts over data streams
inferredcites →https://doi.org/10.1561/0400000002openalex-snapshot
Data Streams: Algorithms and Applications
inferredcites →https://doi.org/10.1561/9781933019604openalex-snapshot
Data Streams: Algorithms and Applications
inferredcites →https://doi.org/10.17487/rfc2330openalex-snapshot
Framework for IP Performance Metrics
inferredcites →https://doi.org/10.5555/1070432.1070537openalex-snapshot
Graph distances in the streaming model: the value of space
inferredcites →https://doi.org/10.5555/1109557.1109634openalex-snapshot
Simpler algorithm for estimating frequency moments of data streams
inferredcites →https://doi.org/10.5555/1109557.1109636openalex-snapshot
Maintaining significant stream statistics over sliding windows
inferredcites →https://doi.org/10.5555/1109557.1109685openalex-snapshot
The space complexity of pass-efficient algorithms for clustering
inferredcites →https://doi.org/10.5555/1182635.1164180openalex-snapshot
On biased reservoir sampling in the presence of stream evolution
inferredcites →https://doi.org/10.5555/1283383.1283418openalex-snapshot
A near-optimal algorithm for computing the entropy of a stream
inferredcites →https://doi.org/10.5555/545381.545464openalex-snapshot
Reductions in streaming algorithms, with an application to counting triangles in graphs
inferredcites →https://doi.org/10.5555/545381.545465openalex-snapshot
Sampling from a moving window over streaming data
inferredcites →https://doi.org/10.5555/545381.545466openalex-snapshot
Maintaining stream statistics over sliding windows: (extended abstract)
inferredcites →https://doi.org/10.5555/982792.982815openalex-snapshot
An improved data stream algorithm for frequency moments
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_797openalex-snapshot
Sliding Window Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-19955-5_21openalex-snapshot
Derandomization for Sliding Window Algorithms with Strict Correctness
inferred← citeshttps://doi.org/10.1007/978-3-030-34387-3_16openalex-snapshot
One-Step Prediction for GM(1,1) with a Sliding Data Window
inferred← citeshttps://doi.org/10.1007/978-3-030-89543-3_44openalex-snapshot
Symmetric Norm Estimation and Regression on Sliding Windows
inferred← citeshttps://doi.org/10.1007/978-3-031-22365-5_13openalex-snapshot
Secure Sampling with Sublinear Communication
inferred← citeshttps://doi.org/10.1007/978-3-319-63962-8_193-1openalex-snapshot
Types of Stream Processing Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-63962-8_193-2openalex-snapshot
Types of Stream Processing Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-63962-8_193-3openalex-snapshot
Types of Stream Processing Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-77313-1_2openalex-snapshot
Sliding Window Algorithms for Regular Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-77525-8_193openalex-snapshot
Types of Stream Processing Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_797-1openalex-snapshot
Sliding Window Algorithms
inferred← citeshttps://doi.org/10.1007/s00224-020-10000-1openalex-snapshot
Derandomization for Sliding Window Algorithms with Strict Correctness∗
inferred← citeshttps://doi.org/10.1007/s00500-019-03863-1openalex-snapshot
Sliding-window metaheuristic optimization-based forecast system for foreign exchange analysis
inferred← citeshttps://doi.org/10.1007/s00778-017-0461-xopenalex-snapshot
Stream sampling over windows with worst-case optimality and $$\ell $$ ℓ -overlap independence
inferred← citeshttps://doi.org/10.1016/j.asoc.2022.109642openalex-snapshot
Intelligent candlestick forecast system for financial time-series analysis using metaheuristics-optimized multi-output machine learning
inferred← citeshttps://doi.org/10.1016/j.imu.2021.100565openalex-snapshot
Conditional sliding windows: An approach for handling data limitation in colorectal histopathology image classification
inferred← citeshttps://doi.org/10.1016/j.neucom.2014.08.063openalex-snapshot
Uncertain canonical correlation analysis for multi-view feature extraction from uncertain data streams
inferred← citeshttps://doi.org/10.1016/j.ssci.2019.04.047openalex-snapshot
Anomaly detection method for sensor network data streams based on sliding window sampling and optimized clustering
inferred← citeshttps://doi.org/10.1080/13658816.2012.654792openalex-snapshot
An efficient outlying trajectories mining approach based on relative distance
inferred← citeshttps://doi.org/10.1103/dp67-q1xtopenalex-snapshot
Quantum strategies to overcome classical multiplexing limits
inferred← citeshttps://doi.org/10.1109/dsaa60987.2023.10302599openalex-snapshot
Sliding Window Sampling over Data Stream – a Solution Based on Devil’s Staircases
inferred← citeshttps://doi.org/10.1109/focs.2013.39openalex-snapshot
Element Distinctness, Frequency Moments, and Sliding Windows
inferred← citeshttps://doi.org/10.1109/focs.2018.00058openalex-snapshot
Perfect Lp Sampling in a Data Stream
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00116openalex-snapshot
Tight Bounds for Adversarially Robust Streams and Sliding Windows via Difference Estimators
inferred← citeshttps://doi.org/10.1109/fuzz-ieee.2013.6622410openalex-snapshot
Dynamic feature selection with fuzzy-rough sets
inferred← citeshttps://doi.org/10.1109/ipdps.2015.97openalex-snapshot
Distinct Random Sampling from a Distributed Stream
inferred← citeshttps://doi.org/10.1109/tkde.2016.2518679openalex-snapshot
A Simple Message-Optimal Algorithm for Random Sampling from a Distributed Stream
inferred← citeshttps://doi.org/10.1109/wisa.2014.47openalex-snapshot
A Sampling Method of Finding Top-k Frequent Items on Timestamp-Based Stream
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch95openalex-snapshot
Clustering Problems on Sliding Windows
inferred← citeshttps://doi.org/10.1137/18m1229912openalex-snapshot
Perfect $L_p$ Sampling in a Data Stream
inferred← citeshttps://doi.org/10.1145/2745754.2745757openalex-snapshot
External Memory Stream Sampling
inferred← citeshttps://doi.org/10.1145/3294052.3319696openalex-snapshot
Weighted Reservoir Sampling from Distributed Streams
inferred← citeshttps://doi.org/10.1145/3517804.3524139openalex-snapshot
Truly Perfect Samplers for Data Streams and Sliding Windows
inferred← citeshttps://doi.org/10.1145/3725243openalex-snapshot
Perfect Sampling in Turnstile Streams Beyond Small Moments
inferred← citeshttps://doi.org/10.1145/3801918openalex-snapshot
Unbiased Insights: Optimal Streaming Algorithms for ℓ p Sampling, the Forget Model, and Beyond
inferred← citeshttps://doi.org/10.11606/t.55.2018.tde-19102018-145846openalex-snapshot
Agrupamento de fluxos de dados utilizando dimensão fractal
inferred← citeshttps://doi.org/10.14569/ijacsa.2021.01212106openalex-snapshot
Predicting Stock Closing Prices in Emerging Markets with Transformer Neural Networks: The Saudi Stock Exchange Case
inferred← citeshttps://doi.org/10.1504/ijkedm.2015.074083openalex-snapshot
Sequential Pattern Mining (SPM) for user-inputted data sets: an empirical framework using bitwise operations
inferred← citeshttps://doi.org/10.21105/jcon.00202openalex-snapshot
StreamSampling.jl: Efficient Sampling from Data Streams in Julia
inferred← citeshttps://doi.org/10.3390/proceedings2191262openalex-snapshot
Multimodal Sensor Data Fusion for Activity Recognition Using Filtered Classifier
inferred← citeshttps://doi.org/10.3929/ethz-b-000442917openalex-snapshot
$L_p$ Pattern Matching in a Stream
inferred← citeshttps://doi.org/10.4230/dfu.vol5.10452.237openalex-snapshot
Algorithmic Techniques for Processing Data Streams
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2015.350openalex-snapshot
Clustering on Sliding Windows in Polylogarithmic Space
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2018.127openalex-snapshot
Randomized Sliding Window Algorithms for Regular Languages
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2019.6openalex-snapshot
Sliding Window Property Testing for Regular Languages
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2018.31openalex-snapshot
Automata Theory on Sliding Windows
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2019.29openalex-snapshot
Visibly Pushdown Languages over Sliding Windows
inferred← citeshttps://doi.org/10.48550/arxiv.1111.3022openalex-snapshot
Design of a Sliding Window over Asynchronous Event Streams
inferred← citeshttps://doi.org/10.48550/arxiv.1212.4372openalex-snapshot
Sliding Windows with Limited Storage
inferred← citeshttps://doi.org/10.48550/arxiv.1504.05553openalex-snapshot
A Unified Approach for Clustering Problems on Sliding Windows
inferred← citeshttps://doi.org/10.48550/arxiv.1904.04126openalex-snapshot
Weighted Reservoir Sampling from Distributed Streams
inferred← citeshttps://doi.org/10.5753/jidm.2015.1554openalex-snapshot
KSample: Dynamic Sampling Over Unbounded Data Streams
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.