4255 search results - page 133 / 851 » Cover |
115
click to vote
IROS
2007
IEEE
15 years 10 months ago
2007
IEEE
— In this paper, we study how multiple robots can cover known terrain quickly. We extend Multi-Robot Forest Coverage, a state-of-the-art multi-robot coverage algorithm, from terr...
146
click to vote
ESA
2001
Springer
15 years 8 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
127
click to vote
ICPR
2000
IEEE
15 years 8 months ago
2000
IEEE
All the methods for estimating the fundamental matrix do not naturally exploit the rank-2 constraint. For these reason some few rank-2 parameterizations of the fundamental matrix ...
120
click to vote
MMB
1999
Springer
15 years 8 months ago
1999
Springer
Auctions are a widely used approach for determining the current market price for congested resources. However, using them for real systems, such as the Internet, the auction algor...
116
click to vote
IH
1998
Springer
15 years 8 months ago
1998
Springer
An information-theoretic model for steganography with passive adversaries is proposed. The adversary's task of distinguishing between an innocent cover message C and a modi e...