13214 search results - page 2280 / 2643 » Pseudorandomness for network algorithms |
170
click to vote
IEEESCC
2009
IEEE
16 years 1 months ago
2009
IEEE
In many applications involving composite Web services, one or more component services may become unavailable. This presents us with the problem of identifying other components tha...
182
click to vote
IROS
2009
IEEE
16 years 1 months ago
2009
IEEE
— This paper describes an algorithm for estimating lane boundaries and curbs from a moving vehicle using noisy observations and a probabilistic model of curvature. The primary co...
228
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper, we propose a new compact and low delay routing labeling scheme for Unit Disk Graphs (UDGs) which often model wireless ad hoc networks. We show that one can...
182
click to vote
WDAG
2009
Springer
16 years 1 months ago
2009
Springer
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
171
click to vote
WEBI
2009
Springer
16 years 1 months ago
2009
Springer
The World Wide Web has transformed into an environment where users both produce and consume information. In order to judge the validity of information, it is important to know how...