Sciweavers

1578 search results - page 54 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
ESANN
2006
13 years 10 months ago
Cluster detection algorithm in neural networks
Complex networks have received much attention in the last few years, and reveal global properties of interacting systems in domains like biology, social sciences and technology. O...
David Meunier, Hélène Paugam-Moisy
SASN
2004
ACM
14 years 2 months ago
Source-location privacy in energy-constrained sensor network routing
As sensor-driven applications become increasingly integrated into our lives, issues related to sensor privacy will become increasingly important. Although many privacy-related iss...
Celal Ozturk, Yanyong Zhang, Wade Trappe
MST
2010
106views more  MST 2010»
13 years 7 months ago
Constrained-Path Labellings on Graphs of Bounded Clique-Width
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
Bruno Courcelle, Andrew Twigg
SPAA
2006
ACM
14 years 2 months ago
On space-stretch trade-offs: lower bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
WADS
2009
Springer
262views Algorithms» more  WADS 2009»
14 years 3 months ago
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs
Abstract. In this paper, we propose a new compact and low delay routing labeling scheme for Unit Disk Graphs (UDGs) which often model wireless ad hoc networks. We show that one can...
Chenyu Yan, Yang Xiang, Feodor F. Dragan