486 search results - page 58 / 98 » Improved upper bounds for 3-SAT |
INFOCOM
2009
IEEE
14 years 4 months ago
2009
IEEE
—We analyze how node mobility can influence the convergence time of averaging gossip algorithms on networks. Our main result is that even a small number of fully mobile nodes ca...
FSTTCS
2009
Springer
14 years 4 months ago
2009
Springer
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
ISPDC
2008
IEEE
14 years 4 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
ICALP
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
SCN
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Span programs provide a linear algebraic model of computation. Monotone span programs (MSP) correspond to linear secret sharing schemes. This paper studies the properties...