2430 search results - page 227 / 486 » Computing Tutte Polynomials |
120
click to vote
LICS
2009
IEEE
15 years 11 months ago
2009
IEEE
—We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations o...
156
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorith...
125
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...
149
click to vote
WDAG
2007
Springer
15 years 10 months ago
2007
Springer
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
146
click to vote
ICPP
2006
IEEE
15 years 10 months ago
2006
IEEE
Modeling the performance behavior of parallel applications to predict the execution times of the applications for larger problem sizes and number of processors has been an active ...