Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Udi Wieder"'
Publikováno v:
The Journal of Privacy and Confidentiality, Vol 12, Iss 1 (2022)
Data exploration systems that provide differential privacy must manage a privacy budget that measures the amount of privacy lost across multiple queries. One effective strategy to manage the privacy budget is to compute a one-time private synopsis of
Externí odkaz:
https://doaj.org/article/c737a67515da47e287e01d4aaac96502
Publikováno v:
Proceedings of the vldb endowment, 12(11), 1442-1457. ASSOC COMPUTING MACHINERY
Hillview is a distributed spreadsheet for browsing very large datasets that cannot be handled by a single machine. As a spread-sheet, Hillview provides a high degree of interactivity that permits data analysts to explore information quickly along man
Autor:
Udi Wieder
Publikováno v:
Foundations and Trends® in Theoretical Computer Science. 12:275-379
Publikováno v:
Advances in Cryptology – EUROCRYPT 2018 ISBN: 9783319783710
EUROCRYPT (3)
EUROCRYPT (3)
While there has been a lot of progress in designing efficient custom protocols for computing Private Set Intersection (PSI), there has been less research on using generic Multi-Party Computation (MPC) protocols for this task. However, there are many
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f4ff42dcc990bb8be91ed5fcbb602d3
https://doi.org/10.1007/978-3-319-78372-7_5
https://doi.org/10.1007/978-3-319-78372-7_5
Autor:
Udi Wieder
Many tasks in computer systems could be abstracted as distributing items into buckets, so that the allocation of items across buckets is as balanced as possible, and, furthermore, given an item's identifier it is possible to determine quickly to whic
Publikováno v:
Random Structures & Algorithms. 47:760-775
Suppose m balls are sequentially thrown into n bins where each ball goes into a random bin. It is well-known that the gap between the load of the most loaded bin and the average is i¾?mlognn, for large m. If each ball goes to the lesser loaded of tw
Publikováno v:
FOCS
A fundamental fact in the analysis of randomized algorithms is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contains at most O(log n / log(log n)) balls. In various applications, howev
Publikováno v:
SPLASH (Companion Volume)
Log management systems are common in industry and an essential part of a system administrator’s toolkit. Examples include Splunk, elk, Log Insight, Sexilog, and more. Logs in these systems are characterized by a small number of predefined fields su
Publikováno v:
SIAM Journal on Computing. 39:1543-1561
Cuckoo hashing holds great potential as a high-performance hashing scheme for real applications. Up to this point, the greatest drawback of cuckoo hashing appears to be that there is a polynomially small but practically significant probability that a
Autor:
John MacCormick, Junfeng Yang, Udi Wieder, Nick Murphy, Venugopalan Ramasubramanian, Lidong Zhou
Publikováno v:
ACM Transactions on Storage. 4:1-28
Kinesis is a novel data placement model for distributed storage systems. It exemplifies three design principles: structure (division of servers into a few failure-isolated segments), freedom of choice (freedom to allocate the best servers to store an