3946 search results - page 124 / 790 » The computational complexity of choice sets |
174
click to vote
SMA
2005
ACM
16 years 2 days ago
2005
ACM
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
232
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
Saliency estimation has become a valuable tool in image processing. Yet, existing approaches exhibit considerable variation in methodology, and it is often difficult to attribute...
148
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The work establishes fundamental limits between rate, reliability and computational complexity, for the general setting of outage-limited MIMO communications. In the high-SNR regim...
177
click to vote
ECCC
2006
15 years 6 months ago
2006
Abstract. Circuits composed of threshold gates (McCulloch-Pitts neurons, or perceptrons) are simplified models of neural circuits with the advantage that they are theoretically mor...
185
click to vote
FCT
2007
Springer
16 years 20 days ago
2007
Springer
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...