1322 search results - page 38 / 265 » Parameterized counting problems |
CSL
2004
Springer
14 years 2 months ago
2004
Springer
The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems, ¢¡ , comprised of finite, but arbitrarily many,...
IPPS
2010
IEEE
13 years 6 months ago
2010
IEEE
We present collaborative peer-to-peer algorithms for the problem of approximating frequency counts for popular items distributed across the peers of a large-scale network. Our alg...
SIAMCOMP
2008
13 years 8 months ago
2008
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomi...
COMBINATORICS
2002
13 years 8 months ago
2002
We prove that the space of possible final configurations for a parking problem is parameterized by the vertices of a regular Bruhat graph associated to a 231-avoiding permutation,...
COLT
2005
Springer
14 years 2 months ago
2005
Springer
We study the problem of learning a kernel which minimizes a regularization error functional such as that used in regularization networks or support vector machines. We consider thi...