Matrix rounding, evolutionary algorithms, and hole detection
C Klein - 2013 - publikationen.sulb.uni-saarland.de
In this thesis we study three different topics from the field of algorithms and data structures.
First, we investigate a problem from statistics. We give two randomised algorithms that can …
First, we investigate a problem from statistics. We give two randomised algorithms that can …
Hole detection or: " how much geometry hides in connectivity?"
S Funke, C Klein - Proceedings of the twenty-second annual symposium …, 2006 - dl.acm.org
Wireless sensor networks typically consist of small, very simple network nodes without any
positioning device like GPS. After an initialization phase, the nodes know with whom they …
positioning device like GPS. After an initialization phase, the nodes know with whom they …
Topological hole detection in wireless sensor networks and its applications
S Funke - Proceedings of the 2005 joint workshop on …, 2005 - dl.acm.org
The identification of holes in a wireless sensor network is of primary interest since the
breakdown of sensor nodes in a larger area often indicates one of the special events to be …
breakdown of sensor nodes in a larger area often indicates one of the special events to be …
An Analysis of the Min-max Algorithm
J Cislo - arXiv preprint arXiv:1103.0533, 2011 - arxiv.org
arXiv:1103.0533v1 [math.PR] 2 Mar 2011 An Analysis of the Min-max Algorithm Page 1
arXiv:1103.0533v1 [math.PR] 2 Mar 2011 An Analysis of the Min-max Algorithm Jerzy Cis lo …
arXiv:1103.0533v1 [math.PR] 2 Mar 2011 An Analysis of the Min-max Algorithm Jerzy Cis lo …
A New Approach for Boundaryand Holes Detection for Wireless Sensor Networks
AS Attia - 2010 - publications.zu.edu.eg
Wireless sensor networks (WSNs) comprise a large number of sensor nodes, whichare
spread out within a region and communicate using wireless links. In some WSNapplications …
spread out within a region and communicate using wireless links. In some WSNapplications …
On extracting consistent graphs in wireless sensor networks
Robustness and security of services like localisation, routing and time synchronisation in
Wireless Sensor Networks (WSNs) have been critical issues. Efficient mathematical (graph …
Wireless Sensor Networks (WSNs) have been critical issues. Efficient mathematical (graph …
Finding the polygon hull in wireless sensor networks
A Bounceur, R Euler, A Benzerbadj, T Kechadi - 2015 - researchrepository.ucd.ie
Finding the border of a wireless sensor network (WSN) is one of the most important issues
today. This border can be used, for example, to monitor a frontier or a secured place of …
today. This border can be used, for example, to monitor a frontier or a secured place of …
Local geometric algorithm for hole boundary detection in sensor networks
A Shirsat, B Bhargava - Security and Communication Networks, 2011 - Wiley Online Library
We present a hole boundary detection algorithm for sensor network which identifies the
geographical boundary of voids in the network assuming the relative geographic information …
geographical boundary of voids in the network assuming the relative geographic information …
[PDF][PDF] Network sketching or: " How Much Geometry Hides in Connectivity?--Part II"
S Funke, N Milosavljevic - Proceedings of the eighteenth …, 2007 - geometry.stanford.edu
Wireless sensor networks typically consist of small, very simple network nodes without any
positioning device like GPS. After an initialization phase, the nodes know with whom they …
positioning device like GPS. After an initialization phase, the nodes know with whom they …
Localised alpha-shape computations for boundary recognition in sensor networks
M Fayed, HT Mouftah - Ad Hoc Networks, 2009 - Elsevier
Intuitively, many wireless and sensing applications benefit from knowledge of network
boundaries. Many virtual coordinate constructions rely on the furthest set of nodes as …
boundaries. Many virtual coordinate constructions rely on the furthest set of nodes as …