1949 search results - page 390 / 390 » Random graphs on surfaces |
115
Voted
IPSN
2011
Springer
14 years 3 months ago
2011
Springer
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
167
click to vote
DC
2011
13 years 11 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
100
click to vote
STOC
2006
ACM
15 years 12 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 ...
108
Voted
FCT
2009
Springer
15 years 6 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...