944 search results - page 143 / 189 » A Survey on Counting Networks |
190
click to vote
MOBISYS
2003
ACM
16 years 5 months ago
2003
ACM
Advances in sensing and tracking technology enable location-based applications but they also create significant privacy risks. Anonymity can provide a high degree of privacy, save...
166
click to vote
EUROPAR
2009
Springer
16 years 18 days ago
2009
Springer
The size of supercomputers in numbers of processors is growing exponentially. Today’s largest supercomputers have upwards of a hundred thousand processors and tomorrow’s may ha...
150
click to vote
FSTTCS
2009
Springer
16 years 18 days ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
205
click to vote
MOBIQUITOUS
2007
IEEE
16 years 9 days ago
2007
IEEE
—Previous work on routing in MANETs has resulted in numerous routing protocols that aim at satisfying constraints such as minimum hop or low energy. Existing routing protocols of...
161
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...