Sciweavers

1127 search results - page 19 / 226
» New Algorithms for Generalized Network Flows
Sort
View
BMCBI
2008
131views more  BMCBI 2008»
14 years 10 months ago
Modifying the DPClus algorithm for identifying protein complexes based on new topological structures
Background: Identification of protein complexes is crucial for understanding principles of cellular organization and functions. As the size of protein-protein interaction set incr...
Min Li, Jianer Chen, Jianxin Wang, Bin Hu, Gang Ch...
WICON
2008
14 years 11 months ago
Stability regions of two-way relaying with network coding
We consider a pair of nodes with stochastic traffic flows who wish to communicate in a bi-directional communication scenario using intermediate relays in two-hop fashion. Intermed...
Ertugrul Necdet Ciftcioglu, Aylin Yener, Randall B...
IOR
2007
119views more  IOR 2007»
14 years 10 months ago
A Decentralized Approach to Discrete Optimization via Simulation: Application to Network Flow
We study a new class of decentralized algorithms for discrete optimization via simulation, which is inspired by the fictitious play algorithm applied to games with identical inte...
Alfredo Garcia, Stephen D. Patek, Kaushik Sinha
CCR
2008
66views more  CCR 2008»
14 years 10 months ago
New directions in mobile communications, or how to learn to stop hating the cellular telephone industry
In this article, we discuss the lessons in innovation from the last twenty years of the Internet that might be applied in the cellular telephone industry. Categories and Subject D...
Jon Crowcroft
STOC
2005
ACM
167views Algorithms» more  STOC 2005»
15 years 10 months ago
Approximately counting integral flows and cell-bounded contingency tables
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
Mary Cryan, Martin E. Dyer, Dana Randall