Sciweavers

3008 search results - page 111 / 602
» Independence in connected graphs
Sort
View
BMCBI
2008
135views more  BMCBI 2008»
15 years 6 months ago
Knowledge-guided multi-scale independent component analysis for biomarker identification
Background: Many statistical methods have been proposed to identify disease biomarkers from gene expression profiles. However, from gene expression profile data alone, statistical...
Li Chen, Jianhua Xuan, Chen Wang, Ie-Ming Shih, Yu...
SSS
2010
Springer
134views Control Systems» more  SSS 2010»
15 years 4 months ago
Storage Capacity of Labeled Graphs
We consider the question of how much information can be stored by labeling the vertices of a connected undirected graph G using a constant-size set of labels, when isomorphic label...
Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang C...
NDSS
2006
IEEE
16 years 12 days ago
Protocol-Independent Adaptive Replay of Application Dialog
For many applications—including recognizing malware variants, determining the range of system versions vulnerable to a given attack, testing defense mechanisms, and filtering m...
Weidong Cui, Vern Paxson, Nicholas Weaver, Randy H...
INFOCOM
2010
IEEE
15 years 4 months ago
TopBT: A Topology-Aware and Infrastructure-Independent BitTorrent Client
—BitTorrent (BT) has carried out a significant and continuously increasing portion of Internet traffic. While several designs have been recently proposed and implemented to imp...
Shansi Ren, Enhua Tan, Tian Luo, Songqing Chen, Le...
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
15 years 11 months ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito