default search action
Edo Liberty
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Sebastian Bruch
, Franco Maria Nardini
An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors. ACM Trans. Inf. Syst. 42(2): 42:1-42:43 (2024) - [i24]Harsha Vardhan Simhadri, Martin Aumüller, Amir Ingber, Matthijs Douze, George Williams, Magdalen Dobson Manohar, Dmitry Baranchuk, Edo Liberty, Frank Liu, Benjamin Landrum, Mazin Karjikar, Laxman Dhulipala, Meng Chen, Yue Chen, Rui Ma, Kai Zhang, Yuzheng Cai, Jiayang Shi, Yizhuo Chen, Weiguo Zheng, Zihao Wan, Jie Yin, Ben Huang:
Results of the Big ANN: NeurIPS'23 competition. CoRR abs/2409.17424 (2024) - 2023
- [j10]Graham Cormode
Relative Error Streaming Quantiles. J. ACM 70(5): 30:1-30:48 (2023) - [i23]Sebastian Bruch
An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors. CoRR abs/2301.10622 (2023) - [i22]Sebastian Bruch
Bridging Dense and Sparse Maximum Inner Product Search. CoRR abs/2309.09013 (2023) - 2022
- [j9]Nikita Ivkin, Edo Liberty, Kevin J. Lang, Zohar S. Karnin, Vladimir Braverman:
Streaming Quantiles Algorithms with Small Space and Update Time. Sensors 22(24): 9612 (2022) - [j8]Graham Cormode
Relative Error Streaming Quantiles. SIGMOD Rec. 51(1): 69-76 (2022) - [i21]Edo Liberty:
Even Simpler Deterministic Matrix Sketching. CoRR abs/2202.01780 (2022) - 2021
- [c29]Graham Cormode
Relative Error Streaming Quantiles. PODS 2021: 96-108 - [i20]Aditya Krishnan, Edo Liberty:
Projective Clustering Product Quantization. CoRR abs/2112.02179 (2021) - 2020
- [c28]Pigi Kouki, Ilias Fountalis, Nikolaos Vasiloglou, Xiquan Cui, Edo Liberty, Khalifeh Al Jadda:
From the lab to production: A case study of session-based recommendations in the home-improvement domain. RecSys 2020: 140-149 - [c27]Edo Liberty, Zohar S. Karnin, Bing Xiang, Laurence Rouesnel, Baris Coskun, Ramesh Nallapati, Julio Delgado, Amir Sadoughi, Yury Astashonok, Piali Das, Can Balioglu, Saswata Chakravarty, Madhav Jha, Philip Gautier, David Arpin, Tim Januschowski, Valentin Flunkert, Yuyang Wang, Jan Gasthaus, Lorenzo Stella, Syama Sundar Rangapuram, David Salinas, Sebastian Schelter, Alex Smola:
Elastic Machine Learning Algorithms in Amazon SageMaker. SIGMOD Conference 2020: 731-737 - [i19]Graham Cormode, Zohar S. Karnin, Edo Liberty, Justin Thaler, Pavel Veselý:
Relative Error Streaming Quantiles. CoRR abs/2004.01668 (2020)
2010 – 2019
- 2019
- [c26]Zohar S. Karnin, Edo Liberty:
Discrepancy, Coresets, and Sketches in Machine Learning. COLT 2019: 1975-1993 - [c25]Yu Bai, Yu-Xiang Wang, Edo Liberty:
ProxQuant: Quantized Neural Networks via Proximal Operators. ICLR (Poster) 2019 - [i18]Zohar S. Karnin, Edo Liberty:
Discrepancy, Coresets, and Sketches in Machine Learning. CoRR abs/1906.04845 (2019) - [i17]Nick Ryder, Zohar S. Karnin, Edo Liberty:
Asymmetric Random Projections. CoRR abs/1906.09489 (2019) - [i16]Nikita Ivkin, Edo Liberty, Kevin J. Lang, Zohar S. Karnin, Vladimir Braverman:
Streaming Quantiles Algorithms with Small Space and Update Time. CoRR abs/1907.00236 (2019) - 2018
- [i15]Yu Bai, Yu-Xiang Wang, Edo Liberty:
ProxQuant: Quantized Neural Networks via Proximal Operators. CoRR abs/1810.00861 (2018) - 2017
- [c24]Edo Liberty, Maxim Sviridenko:
Greedy Minimization of Weakly Supermodular Set Functions. APPROX-RANDOM 2017: 19:1-19:11 - [c23]Daniel Anderson, Pryce Bevan, Kevin J. Lang, Edo Liberty, Lee Rhodes, Justin Thaler:
A high-performance algorithm for identifying frequent items in data streams. Internet Measurement Conference 2017: 268-282 - [i14]Daniel Anderson, Pryce Bevan, Kevin J. Lang, Edo Liberty, Lee Rhodes, Justin Thaler:
A High-Performance Algorithm for Identifying Frequent Items in Data Streams. CoRR abs/1705.07001 (2017) - 2016
- [j7]Mina Ghashami, Edo Liberty, Jeff M. Phillips, David P. Woodruff:
Frequent Directions: Simple and Deterministic Matrix Sketching. SIAM J. Comput. 45(5): 1762-1792 (2016) - [c22]Edo Liberty, Ram Sriharsha, Maxim Sviridenko:
An Algorithm for Online K-Means Clustering. ALENEX 2016: 81-89 - [c21]Zohar S. Karnin, Kevin J. Lang, Edo Liberty:
Optimal Quantile Approximation in Streams. FOCS 2016: 71-78 - [c20]Edo Liberty, Kevin J. Lang, Konstantin Shmakov:
Stratified Sampling Meets Machine Learning. ICML 2016: 2320-2329 - [c19]Mina Ghashami, Edo Liberty, Jeff M. Phillips:
Efficient Frequent Directions Algorithm for Sparse Matrices. KDD 2016: 845-854 - [c18]Edo Liberty, Michael Mitzenmacher, Justin Thaler, Jonathan R. Ullman:
Space Lower Bounds for Itemset Frequency Sketches. PODS 2016: 441-454 - [i13]Mina Ghashami, Edo Liberty, Jeff M. Phillips:
Efficient Frequent Directions Algorithm for Sparse Matrices. CoRR abs/1602.00412 (2016) - [i12]Zohar S. Karnin, Kevin J. Lang, Edo Liberty:
Almost Optimal Streaming Quantiles Algorithms. CoRR abs/1603.05346 (2016) - [i11]Edo Liberty:
A Short Proof for Gap Independence of Simultaneous Iteration. CoRR abs/1605.05610 (2016) - 2015
- [c17]Zohar Shay Karnin, Edo Liberty:
Online with Spectral Bounds. COLT 2015: 1129-1140 - [c16]Christos Boutsidis, Dan Garber, Zohar Shay Karnin, Edo Liberty:
Online Principal Components Analysis. SODA 2015: 887-901 - [i10]Mina Ghashami, Edo Liberty, Jeff M. Phillips, David P. Woodruff:
Frequent Directions : Simple and Deterministic Matrix Sketching. CoRR abs/1501.01711 (2015) - [i9]Christos Boutsidis, Edo Liberty, Maxim Sviridenko:
Greedy Minimization of Weakly Supermodular Set Functions. CoRR abs/1502.06528 (2015) - 2014
- [j6]Liran Katzir
Estimating Sizes of Social Networks via Biased Sampling. Internet Math. 10(3-4): 335-359 (2014) - [c15]Francesco Bonchi, David García-Soriano
Correlation clustering: from theory to practice. KDD 2014: 1972 - [i8]Edo Liberty, Michael Mitzenmacher, Justin Thaler:
Space Lower Bounds for Itemset Frequency Sketches. CoRR abs/1407.3740 (2014) - [i7]Edo Liberty, Ram Sriharsha, Maxim Sviridenko:
An Algorithm for Online K-Means Clustering. CoRR abs/1412.5721 (2014) - 2013
- [j5]Nir Ailon, Edo Liberty:
An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform. ACM Trans. Algorithms 9(3): 21:1-21:12 (2013) - [c14]Edo Liberty:
Simple and deterministic matrix sketching. KDD 2013: 581-588 - [c13]Dimitris Achlioptas, Zohar Shay Karnin, Edo Liberty:
Near-Optimal Entrywise Sampling for Data Matrices. NIPS 2013: 1565-1573 - [c12]Nir Ailon, Zohar Shay Karnin, Edo Liberty, Yoelle Maarek:
Threading machine generated email. WSDM 2013: 405-414 - [i6]Dimitris Achlioptas, Zohar Shay Karnin, Edo Liberty:
Near-Optimal Entrywise Sampling for Data Matrices. CoRR abs/1311.4643 (2013) - 2012
- [j4]Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke van Zuylen:
Improved Approximation Algorithms for Bipartite Correlation Clustering. SIAM J. Comput. 41(5): 1110-1121 (2012) - [c11]Zohar Shay Karnin, Edo Liberty, Shachar Lovett, Roy Schwartz, Omri Weinstein:
Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem. COLT 2012: 2.1-2.17 - [c10]Liran Katzir, Edo Liberty, Oren Somekh:
Framework and algorithms for network bucket testing. WWW 2012: 1029-1036 - [i5]Edo Liberty:
Simple and Deterministic Matrix Sketching. CoRR abs/1206.0594 (2012) - 2011
- [j3]Edo Liberty, Nir Ailon, Amit Singer
Dense Fast Random Projections and Lean Walsh Transforms. Discret. Comput. Geom. 45(1): 34-44 (2011) - [c9]Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke van Zuylen:
Improved Approximation Algorithms for Bipartite Correlation Clustering. ESA 2011: 25-36 - [c8]Yehuda Koren, Edo Liberty, Yoelle Maarek, Roman Sandler:
Automatically tagging email by leveraging other users' folders. KDD 2011: 913-921 - [c7]Nir Ailon, Edo Liberty:
An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform. SODA 2011: 185-191 - [c6]Gal Lavee, Ronny Lempel, Edo Liberty, Oren Somekh:
Inverted index compression via online document routing. WWW 2011: 487-496 - [c5]Liran Katzir, Edo Liberty, Oren Somekh:
Estimating sizes of social networks via biased sampling. WWW 2011: 597-606 - [i4]Edo Liberty, Shachar Lovett, Omri Weinstein:
On the Furthest Hyperplane Problem and Maximal Margin Clustering. CoRR abs/1107.1358 (2011) - 2010
- [c4]Minh Tam Le, John Sweeney, Edo Liberty, Steven W. Zucker:
Similarity kernels via bi-clustering for conventional intergovernmental organizations. ISI 2010: 218-220 - [i3]Nir Ailon, Edo Liberty:
Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform. CoRR abs/1005.5513 (2010) - [i2]Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty:
An Improved Algorithm for Bipartite Correlation Clustering. CoRR abs/1012.3011 (2010)
2000 – 2009
- 2009
- [j2]Nir Ailon, Edo Liberty:
Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes. Discret. Comput. Geom. 42(4): 615-630 (2009) - [j1]Edo Liberty, Steven W. Zucker:
The Mailman algorithm: A note on matrix-vector multiplication. Inf. Process. Lett. 109(3): 179-182 (2009) - [c3]Nir Ailon, Edo Liberty:
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems. ICALP (1) 2009: 24-36 - 2008
- [c2]Edo Liberty, Nir Ailon, Amit Singer
Dense Fast Random Projections and Lean Walsh Transforms. APPROX-RANDOM 2008: 512-522 - [c1]Nir Ailon, Edo Liberty:
Fast dimension reduction using Rademacher series on dual BCH codes. SODA 2008: 1-9 - 2007
- [i1]Nir Ailon, Edo Liberty:
Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes. Electron. Colloquium Comput. Complex. TR07 (2007)
Coauthor Index
aka: Zohar Shay Karnin
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: