1322 search results - page 84 / 265 » Parameterized counting problems |
SAT
2004
Springer
14 years 2 months ago
2004
Springer
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...
STOC
2001
ACM
14 years 9 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
MICS
2010
13 years 7 months ago
2010
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighte...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The paper addresses the problem of learning a regression model parameterized by a fixed-rank positive semidefinite matrix. The focus is on the nonlinear nature of the search space...
FPL
2006
Springer
14 years 16 days ago
2006
Springer
We present a heavily parametrized tool suite that allows the modeling and exploration of heterogeneous, coarse-grained, heavily pipelined reconfigurable architectures. Our tools p...