Sciweavers

116 search results - page 7 / 24
» Testing Euclidean Spanners
Sort
View
ESA
2005
Springer
89views Algorithms» more  ESA 2005»
15 years 5 months ago
Experimental Study of Geometric t-Spanners
Abstract. The construction of t-spanners of a given point set has received a lot of attention, especially from a theoretical perspective. In this paper we perform the first extens...
Mohammad Farshi, Joachim Gudmundsson
AHSWN
2005
120views more  AHSWN 2005»
14 years 11 months ago
Low-Interference Topology Control for Wireless Ad Hoc Networks
Topology control has been well studied in wireless ad hoc networks. However, only a few topology control methods take into account the low interference as a goal of the methods. So...
Kousha Moaveninejad, Xiang-Yang Li
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
15 years 1 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...
IVC
2008
223views more  IVC 2008»
14 years 11 months ago
Euclidean path modeling for video surveillance
In this paper, we address the issue of Euclidean path modeling in a single camera for activity monitoring in a multi-camera video surveillance system. The method consists of a pat...
Imran N. Junejo, Hassan Foroosh
ICASSP
2010
IEEE
14 years 12 months ago
Toward signal processing theory for graphs and non-Euclidean data
Graphs are canonical examples of high-dimensional non-Euclidean data sets, and are emerging as a common data structure in many fields. While there are many algorithms to analyze ...
Benjamin A. Miller, Nadya T. Bliss, Patrick J. Wol...