359 search results - page 50 / 72 » The Parameterized Complexity of Counting Problems |
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
ICCV
2005
IEEE
14 years 1 months ago
2005
IEEE
We present a solution for optimal triangulation in three views. The solution is guaranteed to find the optimal solution because it computes all the stationary points of the (maxi...
EUC
2008
Springer
13 years 9 months ago
2008
Springer
Static path analysis is a key process of Worst Case Execution Time (WCET) estimation, the objective of which is to find the execution path that has the largest execution time. Cur...
AAAI
2004
13 years 9 months ago
2004
From a computational perspective, there is a close connection between various probabilistic reasoning tasks and the problem of counting or sampling satisfying assignments of a pro...
COMCOM
2006
13 years 7 months ago
2006
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (...