8540 search results - page 190 / 1708 » The Dynamic Servers Problem |
105
click to vote
WPES
2003
ACM
15 years 8 months ago
2003
ACM
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
135
click to vote
FUN
2010
Springer
15 years 8 months ago
2010
Springer
In countries such as China or Iran where Internet censorship is prevalent, users usually rely on proxies or anonymizers to freely access the web. The obvious difficulty with this a...
221
click to vote
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
113
click to vote
ATAL
2006
Springer
15 years 6 months ago
2006
Springer
Selecting the right parties to interact with is a fundamental problem in open and dynamic environments. The problem is exemplified when the number of interacting parties is high a...
153
click to vote
KDD
2012
ACM
13 years 5 months ago
2012
ACM
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...