Sciweavers

496 search results - page 71 / 100
» C4-saturated bipartite graphs
Sort
View
ORL
1998
68views more  ORL 1998»
13 years 8 months ago
A fast bipartite network flow algorithm for selective assembly
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick
PPOPP
2010
ACM
14 years 6 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
VLSID
2005
IEEE
100views VLSI» more  VLSID 2005»
14 years 9 months ago
Implementing LDPC Decoding on Network-on-Chip
Low-Density Parity Check codes are a form of Error Correcting Codes used in various wireless communication applications and in disk drives. While LDPC codes are desirable due to t...
Theo Theocharides, Greg M. Link, Narayanan Vijaykr...
RECOMB
2003
Springer
14 years 9 months ago
Towards optimally multiplexed applications of universal DNA tag systems
We study a design and optimization problem that occurs, for example, when single nucleotide polymorphisms (SNPs) are to be genotyped using a universal DNA tag array. The problem o...
Amir Ben-Dor, Tzvika Hartman, Benno Schwikowski, R...
CSR
2009
Springer
14 years 3 months ago
Variations on Muchnik's Conditional Complexity Theorem
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
Daniil Musatov, Andrei E. Romashchenko, Alexander ...