Sciweavers

828 search results - page 31 / 166
» Simplicial Powers of Graphs
Sort
View
MSN
2007
Springer
14 years 2 months ago
Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks
Abstract. We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor net...
Harri Haanpää, André Schumacher, ...
SAC
2008
ACM
13 years 8 months ago
Mining fault-tolerant frequent patterns efficiently with powerful pruning
The mining of frequent patterns in databases has been studied for several years. However, the real-world data tends to be dirty and frequent pattern mining which extracts patterns...
Jhih-Jie Zeng, Guanling Lee, Chung-Chi Lee
ISAAC
2004
Springer
170views Algorithms» more  ISAAC 2004»
14 years 2 months ago
Spanners, Weak Spanners, and Power Spanners for Wireless Networks
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
Christian Schindelhauer, Klaus Volbert, Martin Zie...
HICSS
2010
IEEE
193views Biometrics» more  HICSS 2010»
14 years 3 months ago
The Topological and Electrical Structure of Power Grids
Numerous recent papers have found important relationships between network structure and risks within networks. These results indicate that network structure can dramatically affec...
Paul Hines, Seth Blumsack, E. Cotilla Sanchez, C. ...
SIAMJO
2010
121views more  SIAMJO 2010»
13 years 7 months ago
Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid
Identifying small groups of lines, whose removal would cause a severe blackout, is critical for the secure operation of the electric power grid. We show how power grid vulnerabilit...
Ali Pinar, Juan Meza, Vaibhav Donde, Bernard C. Le...