Sciweavers

2365 search results - page 172 / 473
» All things are connected
Sort
View
CORR
2008
Springer
98views Education» more  CORR 2008»
15 years 6 months ago
Picking up the Pieces: Self-Healing in Reconfigurable Networks
We consider the problem of self-healing in networks that are reconfigurable in the sense that they can change their topology during an attack. Our goal is to maintain connectivity...
Jared Saia, Amitabh Trehan
EJC
2010
15 years 6 months ago
The edge-flipping group of a graph
Let X = (V, E) be a finite simple connected graph with n vertices and m edges. A configuration is an assignment of one of two colors, black or white, to each edge of X. A move app...
Hau-wen Huang, Chih-wen Weng
ADHOC
2006
184views more  ADHOC 2006»
15 years 6 months ago
Wireless underground sensor networks: Research challenges
This work introduces the concept of a Wireless Underground Sensor Network (WUSN). WUSNs can be used to monitor a variety of conditions, such as soil properties for agricultural ap...
Ian F. Akyildiz, Erich P. Stuntebeck
EAAI
2008
116views more  EAAI 2008»
15 years 6 months ago
Robust neuro-identification of nonlinear plants in electric power systems with missing sensor measurements
Fault tolerant measurements are an essential requirement for system identification, control and protection. Measurements can be corrupted or interrupted due to sensor failure, bro...
Wei Qiao, Zhi Gao, Ronald G. Harley, Ganesh K. Ven...
IM
2008
15 years 6 months ago
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
Chen Avin