Sciweavers

6740 search results - page 1272 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
TROB
2008
168views more  TROB 2008»
14 years 11 months ago
A Minimalistic Approach to Appearance-Based Visual SLAM
This paper presents a vision-based approach to SLAM in indoor / outdoor environments with minimalistic sensing and computational requirements. The approach is based on a graph repr...
Henrik Andreasson, Tom Duckett, Achim J. Lilientha...
JPDC
2007
191views more  JPDC 2007»
14 years 11 months ago
Clustering wireless ad hoc networks with weakly connected dominating set
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
Bo Han, Weijia Jia
TWC
2008
80views more  TWC 2008»
14 years 11 months ago
Robust connectivity-aware energy-efficient routing for wireless sensor networks
In this paper, we consider a class of energy-aware routing algorithm that explicitly takes into account the connectivity of the remaining sensor network. In typical sensor network ...
Charles Pandana, K. J. Ray Liu
RC
2000
99views more  RC 2000»
14 years 11 months ago
Interval Constraint Plotting for Interactive Visual Exploration of Implicitly Defined Relations
Conventional plotting programs adopt techniques such as adaptive sampling to approximate, but not to guarantee, correctness and completeness in graphing functions. Moreover, implic...
Timothy J. Hickey, Zhe Qju, Maarten H. van Emden
IPL
2002
93views more  IPL 2002»
14 years 11 months ago
Storing information with extractors
We deal with the problem of storing a set of K elements that are taken from a large universe of size N, such that membership in the set can be determined with high probability by ...
Amnon Ta-Shma
« Prev « First page 1272 / 1348 Last » Next »