5592 search results - page 765 / 1119 » On Random Betweenness Constraints |
191
click to vote
WIOPT
2005
IEEE
16 years 13 days ago
2005
IEEE
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large wireless network. We consider the class of controlled flo...
182
Voted
SPAA
2005
ACM
16 years 13 days ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
216
click to vote
ADHOCNOW
2005
Springer
16 years 12 days ago
2005
Springer
The Hierarchical Layer Graph (HL graph) is a promising network topology for wireless networks with variable transmission ranges. It was introduced and analyzed by Meyer auf der He...
166
click to vote
APPROX
2005
Springer
16 years 12 days ago
2005
Springer
A string α ∈ Σn is called p-periodic, if for every i, j ∈ {1, . . . , n}, such that i ≡ j mod p, αi = αj, where αi is the i-th place of α. A string α ∈ Σn is said t...
199
click to vote
ASIACRYPT
2005
Springer
16 years 12 days ago
2005
Springer
Abstract. A two-argument function is computed privately by two parties if after the computation, no party should know anything about the other inputs except for what he is able to ...