# Tag Info

1

See the following paper. The two problems are equivalent more or less. To see that, assume that the points are on the unit sphere centered at the origin, and observe that if your NN query $q$ is on the sphere, then the far neighbour for the antipodal point $-q$ is the NN to $q$. There might be a full version written somewhere on the web... ...

0

you can think of WWW(world wide web) as a Distributed system which consist of protocols like http,DNS etc. DNS(domain name system) is collection of name server around the world. HTTP servers talks to each other using web services are real example of Distributed system

0

Answer my own question: The answer is (probably; please let me know if I am wrong) negative: it is impossible to simulate sequential registers from causal registers. Note: the following proof is indirect. And I am still interested in a direct proof. Theorem: It is impossible to simulate sequential registers from causal registers. Proof: In the thesis ...

0

Since I can't add a comment on the accepted answer here I am writing a separate answer to point out the error in its argument. The size of the hyperplane at infinity in $\mathbb{F}_q^m$ is not $q^{m-1}$, it is $1 + q + \cdots + q^{m-1}$, and hence it doesn't give a new proof of the Schwartz-Zippel lemma. There is a crucial difference between the argument ...

5

I don't have a solution to this problem, but the analogous case where the two distributions are discrete has been analyzed in the cryptographic literature. Suppose we want to distinguish between two distributions $\mathcal{D}_0$, $\mathcal{D}_1$, where these two distributions are "close". Suppose we have $n$ observations (i.e., a sequence of $n$ numbers ...

Top 50 recent answers are included