1998 search results - page 362 / 400 » Complexity of the Cover Polynomial |
BMCBI
2010
13 years 10 months ago
2010
Background: Sensitivity analysis is an indispensable tool for the analysis of complex systems. In a recent paper, we have introduced a thermodynamically consistent variance-based ...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
DAM
2007
13 years 10 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
PR
2006
13 years 9 months ago
2006
9 Legendre orthogonal moments have been widely used in the field of image analysis. Because their computation by a direct method is very time expensive, recent efforts have been d...
SIGECOM
2008
ACM
13 years 9 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...