Sciweavers

412 search results - page 16 / 83
» Single-Sink Network Design with Vertex Connectivity Requirem...
Sort
View
FOCS
2008
IEEE
14 years 2 months ago
Degree Bounded Network Design with Metric Costs
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Ko...
CN
2007
221views more  CN 2007»
13 years 7 months ago
Adaptive design optimization of wireless sensor networks using genetic algorithms
We present a multi-objective optimization methodology for self-organizing, adaptive wireless sensor network design and energy management, taking into consideration application-spe...
Konstantinos P. Ferentinos, Theodore A. Tsiligirid...
COCOON
2006
Springer
13 years 11 months ago
A Detachment Algorithm for Inferring a Graph from Path Frequency
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
Hiroshi Nagamochi
CCR
2002
81views more  CCR 2002»
13 years 7 months ago
Rationalizing key design decisions in the ATM user plane
Any technology requires some number of key design decisions. In the case of the ATM user plane, the choices to use fixed length, 53 byte cells and virtual connections were unortho...
Daniel B. Grossman
INFOCOM
2011
IEEE
12 years 11 months ago
Fully secure pairwise and triple key distribution in wireless sensor networks using combinatorial designs
—We address pairwise and (for the first time) triple key establishment problems in wireless sensor networks (WSN). We use combinatorial designs to establish pairwise keys betwee...
Sushmita Ruj, Amiya Nayak, Ivan Stojmenovic