Sciweavers

1578 search results - page 47 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
ASAP
2006
IEEE
147views Hardware» more  ASAP 2006»
13 years 10 months ago
Reconfigurable Shuffle Network Design in LDPC Decoders
Several semi-parallel decoding architectures have been explored by researchers for the quasi-cyclic low density parity check (LDPC) codes. In these architectures, the reconfigurab...
Jun Tang, Tejas Bhatt, Vishwas Sundaramurthy
ICC
2008
IEEE
137views Communications» more  ICC 2008»
14 years 3 months ago
On the Effect of Localization Errors on Geographic Routing in Sensor Networks
—Recently, network localization systems that are based on inter-node ranges have received significant attention. Geographic routing has been considered an application which can u...
Bo Peng, Rainer Mautz, Andrew H. Kemp, Washington ...
SODA
2008
ACM
140views Algorithms» more  SODA 2008»
13 years 10 months ago
Minimizing average latency in oblivious routing
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...
Prahladh Harsha, Thomas P. Hayes, Hariharan Naraya...
SIGCOMM
1998
ACM
14 years 27 days ago
Quality of Service Based Routing: A Performance Perspective
Recent studies provide evidence that Quality ofService QoS routing can provide increased network utilization compared to routing that is not sensitive to QoS requirements of tra...
George Apostolopoulos, Roch Guérin, Sanjay ...
RECOMB
2006
Springer
14 years 9 months ago
Probabilistic Paths for Protein Complex Inference
Understanding how individual proteins are organized into complexes and pathways is a significant current challenge. We introduce new algorithms to infer protein complexes by combin...
Hailiang Huang, Lan V. Zhang, Frederick P. Roth, J...