We stand with Ukraine

We stand with Ukraine

Edo Liberty

Orcid: 0000-0003-3132-2785

According to our database¹, Edo Liberty authored at least 45 papers between 2007 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors.

[BibT_eX]

[DOI]

Sebastian Bruch

,

Franco Maria Nardini

,

,

ACM Trans. Inf. Syst., March, 2024

2023

Bridging Dense and Sparse Maximum Inner Product Search.

[BibT_eX]

[DOI]

Sebastian Bruch

,

Franco Maria Nardini

,

,

CoRR, 2023

2022

Relative Error Streaming Quantiles.

[BibT_eX]

[DOI]

,

Zohar S. Karnin

,

,

,

SIGMOD Rec., 2022

Streaming Quantiles Algorithms with Small Space and Update Time.

[BibT_eX]

[DOI]

,

,

,

Zohar S. Karnin

,

Vladimir Braverman

Sensors, 2022

Even Simpler Deterministic Matrix Sketching.

[BibT_eX]

[DOI]

CoRR, 2022

2021

Projective Clustering Product Quantization.

[BibT_eX]

[DOI]

Aditya Krishnan

,

CoRR, 2021

2020

Elastic Machine Learning Algorithms in Amazon SageMaker.

[BibT_eX]

[DOI]

Proceedings of the 2020 International Conference on Management of Data, 2020

From the lab to production: A case study of session-based recommendations in the home-improvement domain.

[BibT_eX]

[DOI]

,

Ilias Fountalis

,

Nikolaos Vasiloglou

,

,

,

Khalifeh Al Jadda

Proceedings of the RecSys 2020: Fourteenth ACM Conference on Recommender Systems, 2020

2019

Asymmetric Random Projections.

[BibT_eX]

[DOI]

,

Zohar S. Karnin

,

CoRR, 2019

ProxQuant: Quantized Neural Networks via Proximal Operators.

[BibT_eX]

[DOI]

,

,

Proceedings of the 7th International Conference on Learning Representations, 2019

Discrepancy, Coresets, and Sketches in Machine Learning.

[BibT_eX]

[DOI]

Zohar S. Karnin

,

Proceedings of the Conference on Learning Theory, 2019

2017

A high-performance algorithm for identifying frequent items in data streams.

[BibT_eX]

[DOI]

Daniel Anderson

,

,

,

,

,

Proceedings of the 2017 Internet Measurement Conference, 2017

Greedy Minimization of Weakly Supermodular Set Functions.

[BibT_eX]

[DOI]

,

Maxim Sviridenko

Proceedings of the Approximation, 2017

2016

Frequent Directions: Simple and Deterministic Matrix Sketching.

[BibT_eX]

[DOI]

,

,

Jeff M. Phillips

,

David P. Woodruff

SIAM J. Comput., 2016

A Short Proof for Gap Independence of Simultaneous Iteration.

[BibT_eX]

[DOI]

CoRR, 2016

Almost Optimal Streaming Quantiles Algorithms.

[BibT_eX]

[DOI]

Zohar S. Karnin

,

,

CoRR, 2016

Space Lower Bounds for Itemset Frequency Sketches.

[BibT_eX]

[DOI]

,

Michael Mitzenmacher

,

,

Jonathan R. Ullman

Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

Efficient Frequent Directions Algorithm for Sparse Matrices.

[BibT_eX]

[DOI]

,

,

Jeff M. Phillips

Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

Stratified Sampling Meets Machine Learning.

[BibT_eX]

[DOI]

,

,

Konstantin Shmakov

Proceedings of the 33nd International Conference on Machine Learning, 2016

Optimal Quantile Approximation in Streams.

[BibT_eX]

[DOI]

Zohar S. Karnin

,

,

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

An Algorithm for Online K-Means Clustering.

[BibT_eX]

[DOI]

,

,

Maxim Sviridenko

Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

2015

Greedy Minimization of Weakly Supermodular Set Functions.

[BibT_eX]

[DOI]

Christos Boutsidis

,

,

Maxim Sviridenko

CoRR, 2015

Online Principal Components Analysis.

[BibT_eX]

[DOI]

Christos Boutsidis

,

,

Zohar Shay Karnin

,

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Online with Spectral Bounds.

[BibT_eX]

[DOI]

Zohar Shay Karnin

,

Proceedings of The 28th Conference on Learning Theory, 2015

2014

Estimating Sizes of Social Networks via Biased Sampling.

[BibT_eX]

[DOI]

,

,

,

Internet Math., 2014

Space Lower Bounds for Itemset Frequency Sketches.

[BibT_eX]

[DOI]

,

Michael Mitzenmacher

,

CoRR, 2014

Correlation clustering: from theory to practice.

[BibT_eX]

[DOI]

Francesco Bonchi

,

David García-Soriano

,

Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014

2013

An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform.

[BibT_eX]

[DOI]

,

ACM Trans. Algorithms, 2013

Threading machine generated email.

[BibT_eX]

[DOI]

,

Zohar Shay Karnin

,

,

Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, 2013

Near-Optimal Entrywise Sampling for Data Matrices.

[BibT_eX]

[DOI]

Dimitris Achlioptas

,

Zohar Shay Karnin

,

Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Simple and deterministic matrix sketching.

[BibT_eX]

[DOI]

Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

2012

Improved Approximation Algorithms for Bipartite Correlation Clustering.

[BibT_eX]

[DOI]

,

Noa Avigdor-Elgrabli

,

,

Anke van Zuylen

SIAM J. Comput., 2012

Framework and algorithms for network bucket testing.

[BibT_eX]

[DOI]

,

,

Proceedings of the 21st World Wide Web Conference 2012, 2012

Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem.

[BibT_eX]

[DOI]

Zohar Shay Karnin

,

,

,

,

Proceedings of the COLT 2012, 2012

2011

Dense Fast Random Projections and Lean Walsh Transforms.

[BibT_eX]

[DOI]

,

,

Discret. Comput. Geom., 2011

On the Furthest Hyperplane Problem and Maximal Margin Clustering

[BibT_eX]

[DOI]

,

,

CoRR, 2011

Inverted index compression via online document routing.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the 20th International Conference on World Wide Web, 2011

Estimating sizes of social networks via biased sampling.

[BibT_eX]

[DOI]

,

,

Proceedings of the 20th International Conference on World Wide Web, 2011

Automatically tagging email by leveraging other users' folders.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2011

2010

An Improved Algorithm for Bipartite Correlation Clustering

[BibT_eX]

[DOI]

,

Noa Avigdor-Elgrabli

,

CoRR, 2010

Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform

[BibT_eX]

[DOI]

,

CoRR, 2010

Similarity kernels via bi-clustering for conventional intergovernmental organizations.

[BibT_eX]

[DOI]

,

,

,

Steven W. Zucker

Proceedings of the IEEE International Conference on Intelligence and Security Informatics, 2010

2009

The Mailman algorithm: A note on matrix-vector multiplication.

[BibT_eX]

[DOI]

,

Steven W. Zucker

Inf. Process. Lett., 2009

Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems.

[BibT_eX]

[DOI]

,

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2007

Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes.

[BibT_eX]

[DOI]

,

Electron. Colloquium Comput. Complex., 2007

Loading...