Sciweavers

13214 search results - page 352 / 2643
» Pseudorandomness for network algorithms
Sort
View
BMCBI
2010
164views more  BMCBI 2010»
15 years 7 months ago
Investigating the validity of current network analysis on static conglomerate networks by protein network stratification
Background: A molecular network perspective forms the foundation of systems biology. A common practice in analyzing protein-protein interaction (PPI) networks is to perform networ...
Minlu Zhang, Long J. Lu
IPPS
1997
IEEE
15 years 11 months ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen
NETWORKING
2007
15 years 8 months ago
Maximum Energy Welfare Routing in Wireless Sensor Networks
Most routing algorithms for sensor networks focus on finding energy efficient paths to prolong the lifetime of sensor networks. As a result, the sensors on the efficient paths are ...
Changsoo Ok, Prasenjit Mitra, Seokcheon Lee, Sound...
TSP
2008
89views more  TSP 2008»
15 years 6 months ago
Noncooperative Eigencoding for MIMO Ad hoc Networks
A new noncooperative eigencoding algorithm is introduced for MIMO Ad hoc networks. The algorithm performs generalized waterfilling with respect to its transmit covariance matrix a...
Duong A. Hoang, Ronald A. Iltis
WDAG
2001
Springer
76views Algorithms» more  WDAG 2001»
15 years 11 months ago
An Effective Characterization of Computability in Anonymous Networks
We provide effective (i.e., recursive) characterizations of the relations that can be computed on networks where all processors use the same algorithm, start from the same state, a...
Paolo Boldi, Sebastiano Vigna