425 search results - page 84 / 85 » Polynomial Factorization 1987-1991 |
DAM
2007
13 years 7 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
SIAMSC
2008
13 years 7 months ago
2008
We study preconditioners for the iterative solution of the linear systems arising in the implicit time integration of the compressible Navier-Stokes equations. The spatial discreti...
SIGECOM
2008
ACM
13 years 7 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
ISCA
2002
IEEE
13 years 7 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...