106 search results - page 19 / 22 » Almost random graphs with simple hash functions |
114
click to vote
STOC
2007
ACM
16 years 2 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
125
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...
126
Voted
INFOCOM
2006
IEEE
15 years 7 months ago
2006
IEEE
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...
110
click to vote
CN
2007
15 years 1 months ago
2007
Most users have multiple accounts on the Internet where each account is protected by a password. To avoid the headache in remembering and managing a long list of different and un...
146
click to vote
TPDS
2010
15 years 2 days ago
2010
—One widely used mechanism for representing membership of a set of items is the simple space-efficient randomized data structure known as Bloom filters. Yet, Bloom filters are no...