1480 search results - page 238 / 296 » Distributed algorithms for weighted problems in sparse graph... |
111
click to vote
SIGMOD
1996
ACM
15 years 7 months ago
1996
ACM
This paper introduces bifocal sampling, a new technique for estimating the size of an equi-join of two relations. Bifocal sampling classi es tuples in each relation into two group...
122
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
126
click to vote
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...
105
Voted
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
We study the concept of bribery in the situation where voters are willing to change their votes as we ask them, but where their prices depend on the nature of the change we reques...
133
click to vote
STOC
1993
ACM
15 years 7 months ago
1993
ACM
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...