Sciweavers

3192 search results - page 489 / 639
» The minimum latency problem
Sort
View
IANDC
2008
92views more  IANDC 2008»
15 years 26 days ago
Tree exploration with advice
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
COMCOM
2006
154views more  COMCOM 2006»
15 years 26 days 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
114
Voted
JSAC
2006
107views more  JSAC 2006»
15 years 23 days ago
Adaptive Sensor Activity Control in Many-to-One Sensor Networks
Abstract--In this paper, we consider a many-to-one sensor network where a large number of sensors are deployed to monitor a physical environment. We explore sensor activity managem...
Zhifeng Hu, Junshan Zhang, Lang Tong
86
Voted
BMCBI
2005
67views more  BMCBI 2005»
15 years 21 days ago
Selecting additional tag SNPs for tolerating missing data in genotyping
Background: Recent studies have shown that the patterns of linkage disequilibrium observed in human populations have a block-like structure, and a small subset of SNPs (called tag...
Yao-Ting Huang, Kui Zhang, Ting Chen, Kun-Mao Chao
121
Voted
JCO
2007
65views more  JCO 2007»
15 years 21 days ago
Group testing in graphs
This paper studies the group testing problem in graphs as follows. Given a graph G = (V, E), determine the minimum number t(G) such that t(G) tests are sufficient to identify an u...
Justie Su-tzu Juan, Gerard J. Chang