1536 search results - page 97 / 308 » Approximately Dominating Representatives |
261
click to vote
Book
"From an applications viewpoint, the main reason to study the subject of these notes is to help deal with the complexity of describing random, time-varying functions. A random...
156
click to vote
ICIP
2000
IEEE
16 years 5 months ago
2000
IEEE
In this paper, we presentan approach to clustering images for efficient retrieval using relative entropy. We start with the assumption that visual features are represented by prob...
143
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
121
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
Minimally unsatisfiable subformulas (in short, MUSes) represent the smallest explanations for the inconsistency of SAT instances in terms of the number of involved clauses. Extract...
134
click to vote
TCS
2002
15 years 3 months ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...