Zobrazeno 1 - 10
of 409
pro vyhledávání: '"OSTROVSKY, RAFAIL"'
In the Euclidean $k$-Means problem we are given a collection of $n$ points $D$ in an Euclidean space and a positive integer $k$. Our goal is to identify a collection of $k$ points in the same space (centers) so as to minimize the sum of the squared E
Externí odkaz:
http://arxiv.org/abs/2107.07358
Autor:
Dittmer, Samuel, Ishai, Yuval, Lu, Steve, Ostrovsky, Rafail, Elsabagh, Mohamed, Kiourtis, Nikolaos, Schulte, Brian, Stavrou, Angelos
In this work we describe a token-based solution to Contact Tracing via Distributed Point Functions (DPF) and, more generally, Function Secret Sharing (FSS). The key idea behind the solution is that FSS natively supports secure keyword search on raw s
Externí odkaz:
http://arxiv.org/abs/2012.13053
We give a constant factor polynomial time pseudo-approximation algorithm for min-sum clustering with or without outliers. The algorithm is allowed to exclude an arbitrarily small constant fraction of the points. For instance, we show how to compute a
Externí odkaz:
http://arxiv.org/abs/2011.12169
Autor:
Mathur, Shaan, Ostrovsky, Rafail
We fully characterize self-stabilizing functions in population protocols for complete interaction graphs. In particular, we investigate self-stabilization in systems of $n$ finite state agents in which a malicious scheduler selects an arbitrary seque
Externí odkaz:
http://arxiv.org/abs/2010.03869
Publikováno v:
In Journal of Computer and System Sciences November 2023 137:37-49
We introduce a new coordination problem in distributed computing that we call the population stability problem. A system of agents each with limited memory and communication, as well as the ability to replicate and self-destruct, is subjected to atta
Externí odkaz:
http://arxiv.org/abs/1803.02540
Autor:
Mathur, Shaan, Ostrovsky, Rafail
Publikováno v:
In Information and Computation May 2022 285 Part B
Osborne's iteration is a method for balancing $n\times n$ matrices which is widely used in linear algebra packages, as balancing preserves eigenvalues and stabilizes their numeral computation. The iteration can be implemented in any norm over $\mathb
Externí odkaz:
http://arxiv.org/abs/1704.07406
We study an iterative matrix conditioning algorithm due to Osborne (1960). The goal of the algorithm is to convert a square matrix into a balanced matrix where every row and corresponding column have the same norm. The original algorithm was proposed
Externí odkaz:
http://arxiv.org/abs/1606.08083