Sciweavers

316 search results - page 44 / 64
» Approximation algorithms for hierarchical location problems
Sort
View
INFOCOM
2006
IEEE
15 years 10 months ago
Relay Placement for Higher Order Connectivity in Wireless Sensor Networks
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...
Abhishek Kashyap, Samir Khuller, Mark A. Shayman
143
Voted
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
15 years 5 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...
CORR
2002
Springer
113views Education» more  CORR 2002»
15 years 3 months ago
Robust Global Localization Using Clustered Particle Filtering
Global mobile robot localization is the problem of determining a robot's pose in an environment, using sensor data, when the starting position is unknown. A family of probabi...
Javier Nicolás Sánchez, Adam Milstei...
182
Voted
3DIM
1997
IEEE
15 years 8 months ago
Multi-Resolution Geometric Fusion
Geometric fusion of multiple sets of overlapping surface measurements is an important problem for complete 3D object or environment modelling. Fusion based on a discrete implicit ...
Adrian Hilton, John Illingworth
INFOCOM
2008
IEEE
15 years 10 months ago
Constrained Relay Node Placement in Wireless Sensor Networks to Meet Connectivity and Survivability Requirements
— The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectiv...
Satyajayant Misra, Seung Don Hong, Guoliang Xue, J...