6045 search results - page 202 / 1209 » Computable Linearizations of Well-partial-orderings |
PODC
2012
ACM
11 years 10 months ago
2012
ACM
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
ANTS
1994
Springer
14 years 10 days ago
1994
Springer
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...
SAC
2009
ACM
14 years 3 months ago
2009
ACM
The combinatorial problem of decomposing an integer matrix into a small positive linear combination of binary matrices that have the consecutive-ones property arises in cancer rad...
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
Valiant’s theory of holographic algorithms is a novel methodology to achieve exponential speedups in computation. A fundamental parameter in holographic algorithms is the dimens...
ICDCS
2006
IEEE
14 years 2 months ago
2006
IEEE
We model the overlay using linear capacity constraints, which accurately and succinctly capture overlay link correlations. We show that finding a maximum-bandwidth multicast tree...