Small Summaries for Big Data

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

Autorzy: Cormode, Graham; Maddock, Samuel; Maple, Carsten
Opublikowane w: Proceedings of VLDB, Numer 1, 2021
Wydawca: VLDB Endowment

Similarity of Neural Networks with Gradients

Autorzy: Tang, Shuai; Maddox, Wesley J.; Dickens, Charlie; Diethe, Tom; Damianou, Andreas
Opublikowane w: Numer 4, 2020
Wydawca: ArXiV

Ridge Regression with Frequent Directions: Statistical and Optimization Perspectives

Autorzy: Dickens, Charlie
Opublikowane w: Numer 1, 2020
Wydawca: ArXiV

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

Autorzy: Antoniadis, Antonios; Englert, Matthias; Matsakis, Nicolaos; Veselý, Pavel
Opublikowane w: Numer 5, 2020
Wydawca: ArXiV
DOI: 10.4230/lipics.icalp.2021.17

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

Autorzy: Dickens, Charlie; Meissner, Eric; Moreno, Pablo G.; Diethe, Tom
Opublikowane w: Numer 1, 2020
Wydawca: ArXiV

Independent Set Size Approximation in Graph Streams

Autorzy: Cormode, Graham; Dark, Jacques; Konrad, Christian
Opublikowane w: Numer 6, 2017
Wydawca: ArXiV

Streaming Algorithms for Geometric Steiner Forest

Autorzy: Czumaj, Artur; Jiang, Shaofeng H. -C.; Krauthgamer, Robert; Veselý, Pavel
Opublikowane w: Numer 1, 2020
Wydawca: ArXiV

New results on multi-level aggregation

Autorzy: Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukáš Folwarczný, Łukasz Jeż, Jiří Sgall, Nguyen Kim Thang, Pavel Veselý
Opublikowane w: Theoretical Computer Science, Numer 861, 2021, Strona(/y) 133-143, ISSN 0304-3975
Wydawca: Elsevier BV
DOI: 10.1016/j.tcs.2021.02.016

Parameterized Approximation Algorithms for Bidirected Steiner Network Problems

Autorzy: Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi
Opublikowane w: ACM Transactions on Algorithms, Numer 17/2, 2021, Strona(/y) 1-68, ISSN 1549-6325
Wydawca: Association for Computing Machinary, Inc.
DOI: 10.1145/3447584

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

Autorzy: Graham Cormode, Hossein Jowhari
Opublikowane w: Theoretical Computer Science, Numer 683, 2017, Strona(/y) 22-30, ISSN 0304-3975
Wydawca: Elsevier BV
DOI: 10.1016/j.tcs.2016.06.020

Data sketching

Autorzy: Graham Cormode
Opublikowane w: Communications of the ACM, Numer 60/9, 2017, Strona(/y) 48-55, ISSN 0001-0782
Wydawca: 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

Autorzy: Graham Cormode, Anirban Dasgupta, Amit Goyal, Chi Hoon Lee
Opublikowane w: PLOS ONE, Numer 13/1, 2018, Strona(/y) e0191175, ISSN 1932-6203
Wydawca: Public Library of Science
DOI: 10.1371/journal.pone.0191175

On the Tradeoff between Stability and Fit

Autorzy: Edith Cohen, Graham Cormode, Nick Duffield, Carsten Lund
Opublikowane w: ACM Transactions on Algorithms, Numer 13/1, 2016, Strona(/y) 1-24, ISSN 1549-6325
Wydawca: Association for Computing Machinary, Inc.
DOI: 10.1145/2963103

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

Autorzy: Ge Luo, Lu Wang, Ke Yi, Graham Cormode
Opublikowane w: The VLDB Journal, Numer 25/4, 2016, Strona(/y) 449-472, ISSN 1066-8888
Wydawca: Springer Verlag
DOI: 10.1007/s00778-016-0424-7

Robust lower bounds for communication and stream computation

Autorzy: Amit Chakrabarti, Graham Cormode, Andrew McGregor
Opublikowane w: Theory of Computing, Numer 12/1, 2016, Strona(/y) 1-35, ISSN 1557-2862
Wydawca: Theory of Computing
DOI: 10.4086/toc.2016.v012a010

A Tight Lower Bound for Planar Steiner Orientation

Autorzy: Rajesh Chitnis, Andreas Emil Feldmann, Ondřej Suchý
Opublikowane w: Algorithmica, Numer 81/8, 2019, Strona(/y) 3200-3216, ISSN 0178-4617
Wydawca: Springer Verlag
DOI: 10.1007/s00453-019-00580-x

L p Samplers and Their Applications

Autorzy: Graham Cormode, Hossein Jowhari
Opublikowane w: ACM Computing Surveys, Numer 52/1, 2019, Strona(/y) 1-31, ISSN 0360-0300
Wydawca: Association for Computing Machinary, Inc.
DOI: 10.1145/3297715

Constrained Private Mechanisms for Count Data

Autorzy: Graham Cormode, Tejas Kulkarni, Divesh Srivastava
Opublikowane w: IEEE Transactions on Knowledge and Data Engineering, 2019, Strona(/y) 1-1, ISSN 1041-4347
Wydawca: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tkde.2019.2912179

Verifiable Stream Computation and Arthur--Merlin Communication

Autorzy: Amit Chakrabarti, Graham Cormode, Andrew McGregor, Justin Thaler, Suresh Venkatasubramanian
Opublikowane w: SIAM Journal on Computing, Numer 48/4, 2019, Strona(/y) 1265-1299, ISSN 0097-5397
Wydawca: Society for Industrial and Applied Mathematics
DOI: 10.1137/17m112289x

Answering range queries under local differential privacy

Autorzy: Graham Cormode, Tejas Kulkarni, Divesh Srivastava
Opublikowane w: Proceedings of the VLDB Endowment, Numer 12/10, 2019, Strona(/y) 1126-1138, ISSN 2150-8097
Wydawca: VLDB Endowment
DOI: 10.14778/3339490.3339496

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

Autorzy: Pavel Dvořák, Andreas E. Feldmann, Dušan Knop, Tomáš Masařík, Tomáš Toufar, Pavel Veselý
Opublikowane w: SIAM Journal on Discrete Mathematics, Numer 35/1, 2021, Strona(/y) 546-574, ISSN 0895-4801
Wydawca: 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)

Autorzy: Rajesh H. Chitnis, Andreas E. Feldmann, MohammadTaghi HajiAghayi, Daniel Marx
Opublikowane w: SIAM Journal on Computing, Numer 49/2, 2020, Strona(/y) 318-364, ISSN 0097-5397
Wydawca: Society for Industrial and Applied Mathematics
DOI: 10.1137/18m122371x

Correlation Clustering in Data Streams

Autorzy: Kook Jin Ahn, Graham Cormode, Sudipto Guha, Andrew McGregor, Anthony Wirth
Opublikowane w: Algorithmica, Numer 83/7, 2021, Strona(/y) 1980-2017, ISSN 0178-4617
Wydawca: Springer Verlag
DOI: 10.1007/s00453-021-00816-9

A Tight Lower Bound for Comparison-Based Quantile Summaries

Autorzy: Graham Cormode, Pavel Veselý
Opublikowane w: Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020, Strona(/y) 81-93, ISBN 9781450371087
Wydawca: ACM
DOI: 10.1145/3375395.3387650

Iterative hessian sketch in input sparsity time

Autorzy: Cormode, Graham; Dickens, Charlie
Opublikowane w: Proceedings of Beyond First Order Methods in ML, Numer 1, 2019
Wydawca: Online

Subspace Exploration - Bounds on Projected Frequency Estimation

Autorzy: Graham Cormode, Charlie Dickens, David P. Woodruff
Opublikowane w: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2021, Strona(/y) 273-284, ISBN 9781450383813
Wydawca: ACM
DOI: 10.1145/3452021.3458312

Privacy-Preserving Synthetic Location Data in the Real World

Autorzy: Graham Cormode, Teddy Cunningham, Hakan Ferhatosmanoglu
Opublikowane w: Proceedings of International Symposium on Spatial and Temporal Databases, 2021
Wydawca: ACM

Theory meets Practice: worst case behavior of quantile algorithms

Autorzy: Cormode, Graham; Mishra, Abhinav; Ross, Joseph; Veselý, Pavel
Opublikowane w: Proceedings of SIGKDD 2021, Numer 1, 2021
Wydawca: ACM

Streaming Methods in Data Analysis

Autorzy: Graham Cormode
Opublikowane w: British International Conference on Databases, 2017, Strona(/y) 3-6
Wydawca: Springer International Publishing
DOI: 10.1007/978-3-319-20424-6_1

Engineering Streaming Algorithms

Autorzy: Graham Cormode
Opublikowane w: 2017, ISBN 978-3-95977-036-1
Wydawca: 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

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

Compact Summaries over Large Datasets

Autorzy: Graham Cormode
Opublikowane w: Proceedings of the 34th ACM Symposium on Principles of Database Systems - PODS '15, 2015, Strona(/y) 157-158, ISBN 9781-450327572
Wydawca: ACM Press
DOI: 10.1145/2745754.2745781

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

Autorzy: Sandip Banerjee, Sujoy Bhore, Rajesh Chitnis
Opublikowane w: 2018, Strona(/y) 80-93
Wydawca: Springer International Publishing
DOI: 10.1007/978-3-319-77404-6_7

A Tight Lower Bound for Steiner Orientation

Autorzy: Rajesh Chitnis, Andreas Emil Feldmann
Opublikowane w: 2018, Strona(/y) 65-77
Wydawca: Springer International Publishing
DOI: 10.1007/978-3-319-90530-3_7

Fast Sketch-based Recovery of Correlation Outliers

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

Can We Create Large k-Cores by Adding Few Edges

Autorzy: Rajesh Chitnis, Nimrod Talmon
Opublikowane w: 2018, Strona(/y) 78-89
Wydawca: 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

Autorzy: Rajesh Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Andrew McGregor, Morteza Monemizadeh, Sofya Vorotnikova
Opublikowane w: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2015, Strona(/y) 1326-1344, ISBN 978-1-61197-433-1
Wydawca: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611974331.ch92

Correlation clustering in data streams

Autorzy: Ahn, Kook-Jin, Cormode, Graham, Guha, Sudipto, McGregor, Andrew and Wirth, Anthony Ian
Opublikowane w: Proceedings of the 32nd International Conference on Machine Learning, Numer 32, 2015, Strona(/y) 2237–2246
Wydawca: Journal of Machine Learning Research
DOI: 10.5555/3045118.3045356

Parameterized Approximation Algorithms for Bidirected Steiner Network Problems

Autorzy: Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi
Opublikowane w: 26th Annual European Symposium on Algorithms (ESA 2018), 2018, Strona(/y) 20:1--20:16, ISBN 978-3-95977-081-1
Wydawca: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2018.20

FPT Inapproximability of Directed Cut and Connectivity Problems

Autorzy: Rajesh Chitnis, Andreas Emil Feldmann
Opublikowane w: 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), 2019, Strona(/y) 8:1--8:20, ISBN 978-3-95977-129-0
Wydawca: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.ipec.2019.8

Learning Graphical Models from a Distributed Stream

Autorzy: Yu Zhang, Srikanta Tirthapura, Graham Cormode
Opublikowane w: 2018 IEEE 34th International Conference on Data Engineering (ICDE), 2018, Strona(/y) 725-736, ISBN 978-1-5386-5520-7
Wydawca: IEEE
DOI: 10.1109/icde.2018.00071

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

Autorzy: Graham Cormode, Chris Hickey
Opublikowane w: 2018 IEEE 34th International Conference on Data Engineering (ICDE), 2018, Strona(/y) 1681-1681, ISBN 978-1-5386-5520-7
Wydawca: IEEE
DOI: 10.1109/icde.2018.00213

Marginal Release Under Local Differential Privacy

Autorzy: Graham Cormode, Tejas Kulkarni, Divesh Srivastava
Opublikowane w: Proceedings of the 2018 International Conference on Management of Data - SIGMOD '18, 2018, Strona(/y) 131-146, ISBN 9781-450347037
Wydawca: ACM Press
DOI: 10.1145/3183713.3196906

Privacy at Scale - Local Differential Privacy in Practice

Autorzy: Graham Cormode, Somesh Jha, Tejas Kulkarni, Ninghui Li, Divesh Srivastava, Tianhao Wang
Opublikowane w: Proceedings of the 2018 International Conference on Management of Data - SIGMOD '18, 2018, Strona(/y) 1655-1658, ISBN 9781-450347037
Wydawca: ACM Press
DOI: 10.1145/3183713.3197390

Data Summarization and Distributed Computation

Autorzy: Graham Cormode
Opublikowane w: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18, 2018, Strona(/y) 167-168, ISBN 9781-450357951
Wydawca: ACM Press
DOI: 10.1145/3212734.3212795

Independent Sets in Vertex-Arrival Streams

Autorzy: Graham Cormode, Jacques Dark, Christian Konrad
Opublikowane w: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), 2019, Strona(/y) 45:1--45:14, ISBN 978-3-95977-109-2
Wydawca: 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

Autorzy: Charlie Dickens, Graham Cormode, David Woodruff
Opublikowane w: Proceedings of the 35th International Conference on Machine Learning, 2018, Strona(/y) 1243-1251
Wydawca: PMLR

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

Autorzy: Graham Cormode, Chris Hickey
Opublikowane w: Proceedings of the Twenty-First International Conference on Artificial Intelligence and Statistics, 2018, Strona(/y) 1318-1326
Wydawca: PMLR

Towards a Theory of Parameterized Streaming Algorithms

Autorzy: Rajesh Chitnis, Graham Cormode
Opublikowane w: 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), 2019, Strona(/y) 7:1--7:15
Wydawca: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.ipec.2019.7

Efficient Interactive Proofs for Linear Algebra

Autorzy: Graham Cormode, Chris Hickey
Opublikowane w: 30th International Symposium on Algorithms and Computation (ISAAC 2019), 2019, Strona(/y) 48:1--48:19
Wydawca: 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

Autorzy: Dark, Jacques; Konrad, Christian
Opublikowane w: 35th Computational Complexity Conference (CCC 2020), Numer 2, 2020, ISBN 978-3-95977-156-6
Wydawca: LiPiCS
DOI: 10.4230/lipics.ccc.2020.30

Data-Independent Space Partitionings for Summaries

Autorzy: Graham Cormode, Minos Garofalakis, Michael Shekelyan
Opublikowane w: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2021, Strona(/y) 285-298, ISBN 9781450383813
Wydawca: ACM
DOI: 10.1145/3452021.3458316

Relative Error Streaming Quantiles

Autorzy: Graham Cormode, Zohar Karnin, Edo Liberty, Justin Thaler, Pavel Veselý
Opublikowane w: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2021, Strona(/y) 96-108, ISBN 9781450383813
Wydawca: ACM
DOI: 10.1145/3452021.3458323

Sequential random sampling revisited : hidden shuffle method

Autorzy: Graham Cormode, Michael Shekelyan
Opublikowane w: AISTATS, 2021, ISSN 2640-3498
Wydawca: Aistats.org

Packet Scheduling

Autorzy: Pavel Veselý
Opublikowane w: ACM SIGACT News, Numer 52/2, 2021, Strona(/y) 72-84, ISSN 0163-5700
Wydawca: ACM
DOI: 10.1145/3471469.3471481

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

Autorzy: Graham Cormode, Jacques Dark, Christian Konrad
Opublikowane w: Combinatorial Optimization - 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11–13, 2018, Revised Selected Papers, Numer 10856, 2018, Strona(/y) 101-114, ISBN 978-3-319-96150-7
Wydawca: Springer International Publishing
DOI: 10.1007/978-3-319-96151-4_9

Streaming Algorithms for Bin Packing and Vector Scheduling

Autorzy: Graham Cormode, Pavel Veselý
Opublikowane w: Approximation and Online Algorithms - 17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers, Numer 11926, 2020, Strona(/y) 72-88, ISBN 978-3-030-39478-3
Wydawca: Springer International Publishing
DOI: 10.1007/978-3-030-39479-0_6

Small Summaries for Big Data

Autorzy: Graham Cormode, Ke Yi
Opublikowane w: 2020, ISBN 9781108769938
Wydawca: Cambridge University Press
DOI: 10.1017/9781108769938

Publikacje

Udostępnij tę stronę

Pobierz