2412 search results - page 106 / 483 » Which Problems Have Strongly Exponential Complexity |
139
click to vote
TAMC
2009
Springer
15 years 9 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
153
click to vote
CCCG
2010
15 years 4 months ago
2010
In this paper we consider a natural extension of the socalled reverse facility location problem which was introduced by Cabello et al. [3]. Given a set of n users and a set of m f...
150
click to vote
CSR
2007
Springer
15 years 9 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
135
click to vote
CVPR
2003
IEEE
16 years 5 months ago
2003
IEEE
Probabilistic models have been adopted for many computer vision applications, however inference in highdimensional spaces remains problematic. As the statespace of a model grows, ...
139
click to vote
EUROCRYPT
2010
Springer
15 years 6 months ago
2010
Springer
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior construction...