380 search results - page 15 / 76 » A Categorical Setting for Lower Complexity |
WG
1992
Springer
15 years 1 months ago
1992
Springer
The recognition complexityof ordered set properties is considered, i.e.how many questions have to be asked to decide if an unknown ordered set has a prescribed property. We prove ...
107
click to vote
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
ECCC
2008
14 years 9 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
72
Voted
AI
2008
Springer
14 years 9 months ago
2008
Springer
It is well known that classical set theory is not expressive enough to adequately model categorization and prototype theory. Recent work on compositionality and concept determinat...
DCC
2009
IEEE
15 years 10 months ago
2009
IEEE
The H.264 encoder has input parameters that determine the bit rate and distortion of the compressed video and the encoding complexity. A set of encoder parameters is referred to a...