1998 search results - page 281 / 400 » Complexity of the Cover Polynomial |
119
Voted
APPROX
2007
Springer
15 years 7 months 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...
120
Voted
ECCC
2010
14 years 11 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...
203
Voted
Book
"Artificial Intelligence (AI) is a big field, and this is a big book. We have tried to explore the full breadth of the field, which encompasses logic, probability, and continu...
107
Voted
ICPR
2006
IEEE
16 years 1 months ago
2006
IEEE
Band ratios have many useful applications in hyperspectral image analysis. While optimal ratios have been chosen empirically in previous research, we propose a principled algorith...
110
click to vote
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...