1823 search results - page 14 / 365 » Distributed lossy averaging |
106
click to vote
ICS
2010
Tsinghua U.
15 years 9 months ago
2010
Tsinghua U.
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
74
Voted
INFOCOM
2002
IEEE
15 years 5 months ago
2002
IEEE
Abstract—We propose probabilistic location to enhance the performance of existing peer-to-peer location mechanisms in the case where a replica for the queried data item exists cl...
103
Voted
DCOSS
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We are interested in the problem of computing the average consensus in a distributed fashion on random geometric graphs. We describe a new algorithm called Multi-scale Go...
117
Voted
STACS
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...
99
Voted
SODA
2008
ACM
15 years 1 months ago
2008
ACM
Gibbs sampling also known as Glauber dynamics is a popular technique for sampling high dimensional distributions defined on graphs. Of special interest is the behavior of Gibbs sa...