Titel

Merkliste
1 Ergebnisse

Better Sliding Window Algorithms to Maximize Subadditive an..:

, In: Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems,

Borassi, Michele ; Epasto, Alessandro ; Lattanzi, Silvio.. - p. 254-268 , 2019

Link: https://dl.acm.org/doi/10.1145/3294052.3319701

RT 
T1 <cTitle>Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems</cTitle>: T1 <Title>Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives</Title>

UL https://suche.suub.uni-bremen.de/peid=acm-3319701&Exemplar=1&LAN=DE
				
A1 Borassi, Michele
A1 Epasto, Alessandro
A1 Lattanzi, Silvio
A1 Vassilvitskii, Sergei
A1 Zadimoghaddam, Morteza
PB ACM
YR 2019
K1 diversity maximization
K1 sliding window streams
K1 streaming algorithms
K1 subadditive maximization
K1 submodular maximization
K1 Theory of computation
K1 Models of computation
K1 Streaming models
K1 Mathematics of computing
K1 Mathematical analysis
K1 Mathematical optimization
K1 Discrete optimization
K1 Design and analysis of algorithms
K1 Streaming, sublinear and near linear time algorithms
K1 Approximation algorithms analysis
SP 254
OP 268
LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3294052.3319701
DO https://dl.acm.org/doi/10.1145/3294052.3319701
SF ELIB - SuUB Bremen

Export

RefWorks (nur Desktop-Version!)
Flow (Zuerst in Flow einloggen, dann importieren)