Sciweavers

834 search results - page 58 / 167
» Relative localization using path odometry information
Sort
View
AINA
2009
IEEE
15 years 3 months ago
Approximating Travel Times Using Opportunistic Networking
Determining the time and means by which to travel from location A to location B for a person utilising a MANET requires the dissemination of both realtime and historic data. In thi...
Rudi Ball, Naranker Dulay
COLING
2008
15 years 7 months ago
Representations for category disambiguation
As it serves as a basis for POS tagging, category induction, and human category acquisition, we investigate the information needed to disambiguate a word in a local context, when ...
Markus Dickinson
NETWORKING
2004
15 years 7 months ago
Combining Source- and Localized Recovery to Achieve Reliable Multicast in Multi-hop Ad Hoc Networks
This paper proposes a novel reliable multicast transport protocol for multi-hop, wireless ad hoc networks (or MANETs). To recover from the different types of losses that may occur ...
Venkatesh Rajendran, Katia Obraczka, Yunjung Yi, S...
PODC
2009
ACM
16 years 6 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher
MLQ
1998
126views more  MLQ 1998»
15 years 5 months ago
Reverse Mathematics and Recursive Graph Theory
We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theor...
William I. Gasarch, Jeffry L. Hirst