Sciweavers

149 search results - page 15 / 30
» On Finding Minimum Deadly Sets for Directed Networks
Sort
View
JCB
2006
125views more  JCB 2006»
13 years 7 months ago
Hypothesis Generation in Signaling Networks
Biological signaling networks comprise the chemical processes by which cells detect and respond to changes in their environment. Such networks have been implicated in the regulati...
Derek A. Ruths, Luay Nakhleh, M. Sriram Iyengar, S...
TSP
2008
122views more  TSP 2008»
13 years 7 months ago
Quality of Service and Max-Min Fair Transmit Beamforming to Multiple Cochannel Multicast Groups
The problem of transmit beamforming to multiple cochannel multicast groups is considered, when the channel state is known at the transmitter and from two viewpoints: minimizing tot...
Eleftherios Karipidis, Nikos D. Sidiropoulos, Zhi-...
MIS
1999
Springer
84views Multimedia» more  MIS 1999»
13 years 11 months ago
Minimizing Bandwidth Requirements for On-Demand Data Delivery
Recent techniques for multicast or broadcast delivery of streaming media can provide immediate service to each client request yet achieve considerable client stream sharing (i.e.,...
Derek L. Eager, Mary K. Vernon, John Zahorjan
EOR
2008
136views more  EOR 2008»
13 years 7 months ago
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Ni...
COMCOM
2006
154views more  COMCOM 2006»
13 years 7 months ago
Minimum-cost network hardening using attack graphs
In defending one's network against cyber attack, certain vulnerabilities may seem acceptable risks when considered in isolation. But an intruder can often infiltrate a seemin...
Lingyu Wang, Steven Noel, Sushil Jajodia