Sciweavers

104 search results - page 16 / 21
» Further Results with Localization and Mapping Using Range fr...
Sort
View
CVPR
2001
IEEE
14 years 8 months ago
On Solving 2D and 3D Puzzles Using Curve Matching
We approach the problem of 2-D and 3-D puzzle solving by matching the geometric features of puzzle pieces three at a time. First, we define an affinity measure for a pair of piece...
Weixin Kong, Benjamin B. Kimia
CP
2006
Springer
13 years 10 months ago
Towards an Efficient SAT Encoding for Temporal Reasoning
Abstract. In this paper, we investigate how an IA network can be effectively encoded into the SAT domain. We propose two basic approaches to modelling an IA network as a CSP: one r...
Duc Nghia Pham, John Thornton, Abdul Sattar
ADHOC
2007
122views more  ADHOC 2007»
13 years 6 months ago
Modeling and analyzing the correctness of geographic face routing under realistic conditions
Geographic protocols are very promising for wireless ad hoc and sensor networks due to the low state storage and low message overhead. Under certain idealized conditions, geograph...
Karim Seada, Ahmed Helmy, Ramesh Govindan
JSAC
2011
171views more  JSAC 2011»
13 years 1 months ago
CodeOn: Cooperative Popular Content Distribution for Vehicular Networks using Symbol Level Network Coding
—Driven by both safety concerns and commercial interests, one of the key services offered by vehicular networks is popular content distribution (PCD). The fundamental challenges ...
Ming Li, Zhenyu Yang, Wenjing Lou
EURONGI
2008
Springer
13 years 8 months ago
Interference-Aware Channel Assignment in Wireless Mesh Networks
DED ABSTRACT The increased popularity and the growth in the number of deployed IEEE 802.11 Access Points (APs) have raised the opportunity to merge together various disjointed wire...
Rosario Giuseppe Garroppo, Stefano Giordano, David...