Sciweavers

5473 search results - page 1019 / 1095
» On the graph isomorphism problem
Sort
View
115
Voted
TROB
2008
168views more  TROB 2008»
15 years 19 days 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...
126
Voted
JPDC
2007
191views more  JPDC 2007»
15 years 19 days 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
137
Voted
AI
2004
Springer
15 years 19 days ago
ASSAT: computing answer sets of a logic program by SAT solvers
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
Fangzhen Lin, Yuting Zhao
TWC
2008
80views more  TWC 2008»
15 years 19 days 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
104
Voted
PPL
2000
110views more  PPL 2000»
15 years 15 days ago
Faulty Random Geometric Networks
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
Josep Díaz, Jordi Petit, Maria J. Serna
« Prev « First page 1019 / 1095 Last » Next »