10156 search results - page 1864 / 2032 » Step by Step to Histories |
164
click to vote
OPODIS
2007
15 years 8 months ago
2007
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...
168
click to vote
OPODIS
2007
15 years 8 months ago
2007
Considering an asynchronous system made up of n processes and where up to t of them can crash, finding the weakest assumptions that such a system has to satisfy for a common leade...
217
click to vote
OPODIS
2007
15 years 8 months ago
2007
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....
212
click to vote
TRECVID
2008
15 years 8 months ago
2008
This paper presents our experiments on TRECVID workshop 2008. This year we participated in two challenging tasks, rushes video summarisation and video copy detection tasks. We stu...
208
click to vote
RSS
2007
15 years 8 months ago
2007
Abstract— This paper presents the Discrete Search Leading continuous eXploration (DSLX) planner, a multi-resolution approach to motion planning that is suitable for challenging p...