Sciweavers

159 search results - page 15 / 32
» Codes identifying sets of vertices in random networks
Sort
View
GLOBECOM
2009
IEEE
13 years 11 months ago
Experimental Validation of Periodic Codes for PON Monitoring
In this paper we investigate both experimentally and via simulation the monitoring of fiber link quality in a PON using optical coding technology. We use a new, simple and costeffe...
Mohammad M. Rad, Habib Fathallah, Sophie LaRochell...
BMCBI
2008
179views more  BMCBI 2008»
13 years 7 months ago
Building pathway clusters from Random Forests classification using class votes
Background: Recent years have seen the development of various pathway-based methods for the analysis of microarray gene expression data. These approaches have the potential to bri...
Herbert Pang, Hongyu Zhao
IMC
2006
ACM
14 years 1 months ago
Comprehensive view of a live network coding P2P system
In this paper we present the first implementation of a P2P content distribution system that uses Network Coding. Using results from live trials with several hundred nodes, we pro...
Christos Gkantsidis, John Miller, Pablo Rodriguez
BMCBI
2004
207views more  BMCBI 2004»
13 years 7 months ago
Computational identification of transcription factor binding sites by functional analysis of sets of genes sharing overrep-resen
Background: Transcriptional regulation is a key mechanism in the functioning of the cell, and is mostly effected through transcription factors binding to specific recognition moti...
Davide Corà, Ferdinando Di Cunto, Paolo Pro...
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 7 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner