1383 search results - page 204 / 277 » On the Complexity of the Interlace Polynomial |
180
click to vote
APPROX
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
197
click to vote
ECCC
2010
15 years 4 months ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
293
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
Temporal data analysis in data warehouses and data streaming systems often uses time decay to reduce the importance of older tuples, without eliminating their influence, on the res...
143
click to vote
ICIP
1999
IEEE
16 years 7 months ago
1999
IEEE
The Median-Rational Hybrid Filter (MRHF) has been recently introduced [1][2] as a new class of nonlinear filters and successfully applied to image filtering problems. The main cha...
178
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
This paper investigates how the vision of the Semantic Web can be carried over to the realm of email. We introduce a general notion of semantic email, in which an email message co...