106 search results - page 7 / 22 » Proving Lower Bounds Via Pseudo-random Generators |
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
Various new nonembeddability results (mainly into L1) are proved via Fourier analysis. In particular, it is shown that the Edit Distance on {0, 1}d has L1 distortion (log d) 1 2 â...
SPAA
1994
ACM
13 years 11 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
DAM
2007
13 years 7 months ago
2007
The expected number of n-base long sequences consistent with a given SBH spectrum grows exponentially with n, which severely limits the potential range of applicability of SBH even...
TON
2010
13 years 2 months ago
2010
We consider a class of wireless networks with general interference constraints on the set of links that can be served simultaneously at any given time. We restrict the traffic to b...
AI
1999
Springer
13 years 7 months ago
1999
Springer
Coalition formation is a key topic in multiagent systems. One may prefer a coalition structure that maximizes the sum of the values of the coalitions, but often the number of coal...