10988 search results - page 186 / 2198 » Algorithmic Folding Complexity |
189
click to vote
ICDM
2005
IEEE
16 years 3 days ago
2005
IEEE
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
148
click to vote
APPROX
2005
Springer
16 years 1 days ago
2005
Springer
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
160
click to vote
ISSAC
2005
Springer
16 years 7 hour ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
177
click to vote
OTM
2005
Springer
15 years 12 months ago
2005
Springer
There are many problems requiring a semantic account of a database schema. At its best, such an account consists of mapping formulas between the schema and a formal conceptual mode...
190
click to vote
ICIP
2000
IEEE
15 years 11 months ago
2000
IEEE
In this contribution, we present an algorithm for lowcomplexity global motion estimation, that works with block-coded video (e.g. MPEG-2). A superimposed global motion model is fi...