Sciweavers

68 search results - page 6 / 14
» esa 2007
Sort
View
ESA
2007
Springer
81views Algorithms» more  ESA 2007»
14 years 5 months ago
Farthest-Polygon Voronoi Diagrams
Given a family of k disjoint connected polygonal sites of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the dis...
Otfried Cheong, Hazel Everett, Marc Glisse, Joachi...
DATE
2007
IEEE
160views Hardware» more  DATE 2007»
14 years 5 months ago
FPGA-based networking systems for high data-rate and reliable in-vehicle communications
The amount of electronic systems introduced in vehicles is continuously increasing: X-by-wire, complex electronic control systems and above all future applications such as automot...
Sergio Saponara, Esa Petri, Marco Tonarelli, Iacop...
VTC
2007
IEEE
198views Communications» more  VTC 2007»
14 years 5 months ago
A Distributed Node Scheduling Protocol Considering Sensing Coverage in Wireless Sensor Networks
Abstract— A crucial issue in deploying wireless sensor networks is to perform a sensing task in an area of interest in an energy-efficient manner since sensor nodes have limited...
Jaekyu Cho, Gilsoo Kim, Taekyoung Kwon, Yanghee Ch...
ESA
2007
Springer
188views Algorithms» more  ESA 2007»
14 years 5 months ago
Fast and Compact Oracles for Approximate Distances in Planar Graphs
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
Laurent Flindt Muller, Martin Zachariasen
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
14 years 2 months ago
Finding Mobile Data: Efficiency vs. Location Inaccuracy
A token is hidden in one out of n boxes following some known probability distribution and then all the boxes are locked. The goal of a searcher is to find the token in at most D n...
Amotz Bar-Noy, Joanna Klukowska