1199 search results - page 133 / 240 » Parameterized Proof Complexity |
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
To deal with data uncertainty, existing probabilistic database systems augment tuples with attribute-level or tuple-level probability values, which are loaded into the database al...
ISAAC
2003
Springer
14 years 2 months ago
2003
Springer
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
TVCG
2012
11 years 11 months ago
2012
—Vector field visualization techniques have evolved very rapidly over the last two decades, however, visualizing vector fields on complex boundary surfaces from computational ...
TCS
2010
13 years 7 months ago
2010
We give a new construction of strongly aperiodic set of tiles in H2 , exhibiting a kind of hierarchical structure, simplifying the central framework of Margenstern’s proof that t...
ISSAC
2009
Springer
14 years 3 months ago
2009
Springer
We show that detecting real roots for honestly n-variate (n + 2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any ...