Sciweavers

736 search results - page 24 / 148
» Approximating the Number of Network Motifs
Sort
View
IPPS
2005
IEEE
15 years 3 months ago
Tight Bounds for Wavelength Assignment on Trees of Rings
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
BMCBI
2004
146views more  BMCBI 2004»
14 years 9 months ago
Defining transcriptional networks through integrative modeling of mRNA expression and transcription factor binding data
Background: Functional genomics studies are yielding information about regulatory processes in the cell at an unprecedented scale. In the yeast S. cerevisiae, DNA microarrays have...
Feng Gao, Barrett C. Foat, Harmen J. Bussemaker
BMCBI
2008
138views more  BMCBI 2008»
14 years 10 months ago
M-BISON: Microarray-based integration of data sources using networks
Background: The accurate detection of differentially expressed (DE) genes has become a central task in microarray analysis. Unfortunately, the noise level and experimental variabi...
Bernie J. Daigle Jr., Russ B. Altman
111
Voted
DC
2008
14 years 10 months ago
Approximate distributed top- k queries
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
Boaz Patt-Shamir, Allon Shafrir
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
15 years 3 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking