Sciweavers

12 search results - page 1 / 3
» Fast Discovery of Reliable Subnetworks
Sort
View
ASUNAM
2010
IEEE
13 years 9 months ago
Fast Discovery of Reliable Subnetworks
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
Petteri Hintsanen, Hannu Toivonen, Petteri Sevon
VTC
2006
IEEE
165views Communications» more  VTC 2006»
14 years 1 months ago
Fast and Reliable Route Discovery Protocol Considering Mobility in Multihop Cellular Networks
In multihop cellular network environments, the mobility is a major factor that disturbs finding a reliable routing path between mobile node (MN) and access node (AN). In order to m...
Hyun-Ho Choi, Dong-Ho Cho
ICDM
2005
IEEE
153views Data Mining» more  ICDM 2005»
14 years 1 months ago
Speculative Markov Blanket Discovery for Optimal Feature Selection
In this paper we address the problem of learning the Markov blanket of a quantity from data in an efficient manner. Markov blanket discovery can be used in the feature selection ...
Sandeep Yaramakala, Dimitris Margaritis
BMCBI
2007
227views more  BMCBI 2007»
13 years 7 months ago
Growing functional modules from a seed protein via integration of protein interaction and gene expression data
Background: Nowadays modern biology aims at unravelling the strands of complex biological structures such as the protein-protein interaction (PPI) networks. A key concept in the o...
Ioannis A. Maraziotis, Konstantina Dimitrakopoulou...
BMCBI
2010
144views more  BMCBI 2010»
13 years 7 months ago
Finding sRNA generative locales from high-throughput sequencing data with NiBLS
Background: Next-generation sequencing technologies allow researchers to obtain millions of sequence reads in a single experiment. One important use of the technology is the seque...
Daniel MacLean, Vincent Moulton, David J. Studholm...