Small Summaries for Big Data

Frequency Estimation under Local Differential Privacy [Experiments, Analysis and Benchmarks]

Autori: Cormode, Graham; Maddock, Samuel; Maple, Carsten
Pubblicato in: Proceedings of VLDB, Numero 1, 2021
Editore: VLDB Endowment

Similarity of Neural Networks with Gradients

Autori: Tang, Shuai; Maddox, Wesley J.; Dickens, Charlie; Diethe, Tom; Damianou, Andreas
Pubblicato in: Numero 4, 2020
Editore: ArXiV

Ridge Regression with Frequent Directions: Statistical and Optimization Perspectives

Autori: Dickens, Charlie
Pubblicato in: Numero 1, 2020
Editore: ArXiV

Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop

Autori: Antoniadis, Antonios; Englert, Matthias; Matsakis, Nicolaos; Veselý, Pavel
Pubblicato in: Numero 5, 2020
Editore: ArXiV
DOI: 10.4230/lipics.icalp.2021.17

Interpretable Anomaly Detection with Mondrian P{\'o}lya Forests on Data Streams

Autori: Dickens, Charlie; Meissner, Eric; Moreno, Pablo G.; Diethe, Tom
Pubblicato in: Numero 1, 2020
Editore: ArXiV

Independent Set Size Approximation in Graph Streams

Autori: Cormode, Graham; Dark, Jacques; Konrad, Christian
Pubblicato in: Numero 6, 2017
Editore: ArXiV

Streaming Algorithms for Geometric Steiner Forest

Autori: Czumaj, Artur; Jiang, Shaofeng H. -C.; Krauthgamer, Robert; Veselý, Pavel
Pubblicato in: Numero 1, 2020
Editore: ArXiV

New results on multi-level aggregation

Autori: Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukáš Folwarczný, Łukasz Jeż, Jiří Sgall, Nguyen Kim Thang, Pavel Veselý
Pubblicato in: Theoretical Computer Science, Numero 861, 2021, Pagina/e 133-143, ISSN 0304-3975
Editore: Elsevier BV
DOI: 10.1016/j.tcs.2021.02.016

Parameterized Approximation Algorithms for Bidirected Steiner Network Problems

Autori: Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi
Pubblicato in: ACM Transactions on Algorithms, Numero 17/2, 2021, Pagina/e 1-68, ISSN 1549-6325
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3447584

A second look at counting triangles in graph streams (corrected)

Autori: Graham Cormode, Hossein Jowhari
Pubblicato in: Theoretical Computer Science, Numero 683, 2017, Pagina/e 22-30, ISSN 0304-3975
Editore: Elsevier BV
DOI: 10.1016/j.tcs.2016.06.020

Data sketching

Autori: Graham Cormode
Pubblicato in: Communications of the ACM, Numero 60/9, 2017, Pagina/e 48-55, ISSN 0001-0782
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3080008

An evaluation of multi-probe locality sensitive hashing for computing similarities over web-scale query logs

Autori: Graham Cormode, Anirban Dasgupta, Amit Goyal, Chi Hoon Lee
Pubblicato in: PLOS ONE, Numero 13/1, 2018, Pagina/e e0191175, ISSN 1932-6203
Editore: Public Library of Science
DOI: 10.1371/journal.pone.0191175

On the Tradeoff between Stability and Fit

Autori: Edith Cohen, Graham Cormode, Nick Duffield, Carsten Lund
Pubblicato in: ACM Transactions on Algorithms, Numero 13/1, 2016, Pagina/e 1-24, ISSN 1549-6325
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/2963103

Quantiles over data streams: experimental comparisons, new analyses, and further improvements

Autori: Ge Luo, Lu Wang, Ke Yi, Graham Cormode
Pubblicato in: The VLDB Journal, Numero 25/4, 2016, Pagina/e 449-472, ISSN 1066-8888
Editore: Springer Verlag
DOI: 10.1007/s00778-016-0424-7

Robust lower bounds for communication and stream computation

Autori: Amit Chakrabarti, Graham Cormode, Andrew McGregor
Pubblicato in: Theory of Computing, Numero 12/1, 2016, Pagina/e 1-35, ISSN 1557-2862
Editore: Theory of Computing
DOI: 10.4086/toc.2016.v012a010

A Tight Lower Bound for Planar Steiner Orientation

Autori: Rajesh Chitnis, Andreas Emil Feldmann, Ondřej Suchý
Pubblicato in: Algorithmica, Numero 81/8, 2019, Pagina/e 3200-3216, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-019-00580-x

L p Samplers and Their Applications

Autori: Graham Cormode, Hossein Jowhari
Pubblicato in: ACM Computing Surveys, Numero 52/1, 2019, Pagina/e 1-31, ISSN 0360-0300
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3297715

Constrained Private Mechanisms for Count Data

Autori: Graham Cormode, Tejas Kulkarni, Divesh Srivastava
Pubblicato in: IEEE Transactions on Knowledge and Data Engineering, 2019, Pagina/e 1-1, ISSN 1041-4347
Editore: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tkde.2019.2912179

Verifiable Stream Computation and Arthur--Merlin Communication

Autori: Amit Chakrabarti, Graham Cormode, Andrew McGregor, Justin Thaler, Suresh Venkatasubramanian
Pubblicato in: SIAM Journal on Computing, Numero 48/4, 2019, Pagina/e 1265-1299, ISSN 0097-5397
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/17m112289x

Answering range queries under local differential privacy

Autori: Graham Cormode, Tejas Kulkarni, Divesh Srivastava
Pubblicato in: Proceedings of the VLDB Endowment, Numero 12/10, 2019, Pagina/e 1126-1138, ISSN 2150-8097
Editore: VLDB Endowment
DOI: 10.14778/3339490.3339496

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices

Autori: Pavel Dvořák, Andreas E. Feldmann, Dušan Knop, Tomáš Masařík, Tomáš Toufar, Pavel Veselý
Pubblicato in: SIAM Journal on Discrete Mathematics, Numero 35/1, 2021, Pagina/e 546-574, ISSN 0895-4801
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/18m1209489

Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)

Autori: Rajesh H. Chitnis, Andreas E. Feldmann, MohammadTaghi HajiAghayi, Daniel Marx
Pubblicato in: SIAM Journal on Computing, Numero 49/2, 2020, Pagina/e 318-364, ISSN 0097-5397
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/18m122371x

Correlation Clustering in Data Streams

Autori: Kook Jin Ahn, Graham Cormode, Sudipto Guha, Andrew McGregor, Anthony Wirth
Pubblicato in: Algorithmica, Numero 83/7, 2021, Pagina/e 1980-2017, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-021-00816-9

A Tight Lower Bound for Comparison-Based Quantile Summaries

Autori: Graham Cormode, Pavel Veselý
Pubblicato in: Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020, Pagina/e 81-93, ISBN 9781450371087
Editore: ACM
DOI: 10.1145/3375395.3387650

Iterative hessian sketch in input sparsity time

Autori: Cormode, Graham; Dickens, Charlie
Pubblicato in: Proceedings of Beyond First Order Methods in ML, Numero 1, 2019
Editore: Online

Subspace Exploration - Bounds on Projected Frequency Estimation

Autori: Graham Cormode, Charlie Dickens, David P. Woodruff
Pubblicato in: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2021, Pagina/e 273-284, ISBN 9781450383813
Editore: ACM
DOI: 10.1145/3452021.3458312

Privacy-Preserving Synthetic Location Data in the Real World

Autori: Graham Cormode, Teddy Cunningham, Hakan Ferhatosmanoglu
Pubblicato in: Proceedings of International Symposium on Spatial and Temporal Databases, 2021
Editore: ACM

Theory meets Practice: worst case behavior of quantile algorithms

Autori: Cormode, Graham; Mishra, Abhinav; Ross, Joseph; Veselý, Pavel
Pubblicato in: Proceedings of SIGKDD 2021, Numero 1, 2021
Editore: ACM

Streaming Methods in Data Analysis

Autori: Graham Cormode
Pubblicato in: British International Conference on Databases, 2017, Pagina/e 3-6
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-20424-6_1

Engineering Streaming Algorithms

Autori: Graham Cormode
Pubblicato in: 2017, ISBN 978-3-95977-036-1
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.SEA.2017.3

The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs

Autori: Cormode, Graham, Hossein Jowhari, Monemizadeh, Morteza, Muthukrishnan, S.
Pubblicato in: 25th Annual European Symposium on Algorithms (ESA 2017), 2017, ISBN 978-3-95977-049-1
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ESA.2017.29

Compact Summaries over Large Datasets

Autori: Graham Cormode
Pubblicato in: Proceedings of the 34th ACM Symposium on Principles of Database Systems - PODS '15, 2015, Pagina/e 157-158, ISBN 9781-450327572
Editore: ACM Press
DOI: 10.1145/2745754.2745781

Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets

Autori: Sandip Banerjee, Sujoy Bhore, Rajesh Chitnis
Pubblicato in: 2018, Pagina/e 80-93
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-77404-6_7

A Tight Lower Bound for Steiner Orientation

Autori: Rajesh Chitnis, Andreas Emil Feldmann
Pubblicato in: 2018, Pagina/e 65-77
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-90530-3_7

Fast Sketch-based Recovery of Correlation Outliers

Autori: Graham Cormode Jacques Dark
Pubblicato in: 21st International Conference on Database Theory (ICDT 2018), 2018, ISBN 978-3-95977-063-7
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icdt.2018.13

Can We Create Large k-Cores by Adding Few Edges

Autori: Rajesh Chitnis, Nimrod Talmon
Pubblicato in: 2018, Pagina/e 78-89
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-90530-3_8

Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams

Autori: Rajesh Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Andrew McGregor, Morteza Monemizadeh, Sofya Vorotnikova
Pubblicato in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2015, Pagina/e 1326-1344, ISBN 978-1-61197-433-1
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611974331.ch92

Correlation clustering in data streams

Autori: Ahn, Kook-Jin, Cormode, Graham, Guha, Sudipto, McGregor, Andrew and Wirth, Anthony Ian
Pubblicato in: Proceedings of the 32nd International Conference on Machine Learning, Numero 32, 2015, Pagina/e 2237–2246
Editore: Journal of Machine Learning Research
DOI: 10.5555/3045118.3045356

Parameterized Approximation Algorithms for Bidirected Steiner Network Problems

Autori: Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi
Pubblicato in: 26th Annual European Symposium on Algorithms (ESA 2018), 2018, Pagina/e 20:1--20:16, ISBN 978-3-95977-081-1
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2018.20

FPT Inapproximability of Directed Cut and Connectivity Problems

Autori: Rajesh Chitnis, Andreas Emil Feldmann
Pubblicato in: 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), 2019, Pagina/e 8:1--8:20, ISBN 978-3-95977-129-0
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.ipec.2019.8

Learning Graphical Models from a Distributed Stream

Autori: Yu Zhang, Srikanta Tirthapura, Graham Cormode
Pubblicato in: 2018 IEEE 34th International Conference on Data Engineering (ICDE), 2018, Pagina/e 725-736, ISBN 978-1-5386-5520-7
Editore: IEEE
DOI: 10.1109/icde.2018.00071

You Can Check Others' Work More Quickly Than Doing It Yourself

Autori: Graham Cormode, Chris Hickey
Pubblicato in: 2018 IEEE 34th International Conference on Data Engineering (ICDE), 2018, Pagina/e 1681-1681, ISBN 978-1-5386-5520-7
Editore: IEEE
DOI: 10.1109/icde.2018.00213

Marginal Release Under Local Differential Privacy

Autori: Graham Cormode, Tejas Kulkarni, Divesh Srivastava
Pubblicato in: Proceedings of the 2018 International Conference on Management of Data - SIGMOD '18, 2018, Pagina/e 131-146, ISBN 9781-450347037
Editore: ACM Press
DOI: 10.1145/3183713.3196906

Privacy at Scale - Local Differential Privacy in Practice

Autori: Graham Cormode, Somesh Jha, Tejas Kulkarni, Ninghui Li, Divesh Srivastava, Tianhao Wang
Pubblicato in: Proceedings of the 2018 International Conference on Management of Data - SIGMOD '18, 2018, Pagina/e 1655-1658, ISBN 9781-450347037
Editore: ACM Press
DOI: 10.1145/3183713.3197390

Data Summarization and Distributed Computation

Autori: Graham Cormode
Pubblicato in: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18, 2018, Pagina/e 167-168, ISBN 9781-450357951
Editore: ACM Press
DOI: 10.1145/3212734.3212795

Independent Sets in Vertex-Arrival Streams

Autori: Graham Cormode, Jacques Dark, Christian Konrad
Pubblicato in: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), 2019, Pagina/e 45:1--45:14, ISBN 978-3-95977-109-2
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2019.45

Leveraging Well-Conditioned Bases: Streaming and Distributed Summaries in Minkowski p-Norms

Autori: Charlie Dickens, Graham Cormode, David Woodruff
Pubblicato in: Proceedings of the 35th International Conference on Machine Learning, 2018, Pagina/e 1243-1251
Editore: PMLR

Cheap checking for cloud computing: Statistical analysis via annotated data streams

Autori: Graham Cormode, Chris Hickey
Pubblicato in: Proceedings of the Twenty-First International Conference on Artificial Intelligence and Statistics, 2018, Pagina/e 1318-1326
Editore: PMLR

Towards a Theory of Parameterized Streaming Algorithms

Autori: Rajesh Chitnis, Graham Cormode
Pubblicato in: 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), 2019, Pagina/e 7:1--7:15
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.ipec.2019.7

Efficient Interactive Proofs for Linear Algebra

Autori: Graham Cormode, Chris Hickey
Pubblicato in: 30th International Symposium on Algorithms and Computation (ISAAC 2019), 2019, Pagina/e 48:1--48:19
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.isaac.2019.48

Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams

Autori: Dark, Jacques; Konrad, Christian
Pubblicato in: 35th Computational Complexity Conference (CCC 2020), Numero 2, 2020, ISBN 978-3-95977-156-6
Editore: LiPiCS
DOI: 10.4230/lipics.ccc.2020.30

Data-Independent Space Partitionings for Summaries

Autori: Graham Cormode, Minos Garofalakis, Michael Shekelyan
Pubblicato in: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2021, Pagina/e 285-298, ISBN 9781450383813
Editore: ACM
DOI: 10.1145/3452021.3458316

Relative Error Streaming Quantiles

Autori: Graham Cormode, Zohar Karnin, Edo Liberty, Justin Thaler, Pavel Veselý
Pubblicato in: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2021, Pagina/e 96-108, ISBN 9781450383813
Editore: ACM
DOI: 10.1145/3452021.3458323

Sequential random sampling revisited : hidden shuffle method

Autori: Graham Cormode, Michael Shekelyan
Pubblicato in: AISTATS, 2021, ISSN 2640-3498
Editore: Aistats.org

Packet Scheduling

Autori: Pavel Veselý
Pubblicato in: ACM SIGACT News, Numero 52/2, 2021, Pagina/e 72-84, ISSN 0163-5700
Editore: ACM
DOI: 10.1145/3471469.3471481

Approximating the Caro-Wei Bound for Independent Sets in Graph Streams

Autori: Graham Cormode, Jacques Dark, Christian Konrad
Pubblicato in: Combinatorial Optimization - 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11–13, 2018, Revised Selected Papers, Numero 10856, 2018, Pagina/e 101-114, ISBN 978-3-319-96150-7
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-96151-4_9

Streaming Algorithms for Bin Packing and Vector Scheduling

Autori: Graham Cormode, Pavel Veselý
Pubblicato in: Approximation and Online Algorithms - 17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers, Numero 11926, 2020, Pagina/e 72-88, ISBN 978-3-030-39478-3
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-39479-0_6

Small Summaries for Big Data

Autori: Graham Cormode, Ke Yi
Pubblicato in: 2020, ISBN 9781108769938
Editore: Cambridge University Press
DOI: 10.1017/9781108769938

Pubblicazioni

Condividi questa pagina

Scarica