16666 search results - page 189 / 3334 » Descriptive and Computational Complexity |
157
click to vote
DLOG
2010
15 years 2 months ago
2010
Abstract. Abductive reasoning has been recognized as a valuable complement to deductive inference for tasks such as diagnosis and integration of incomplete information despite its ...
135
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...
136
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
A source is compressible if we can efficiently compute short descriptions of strings in the support and efficiently recover the strings from the descriptions. A source has high ps...
158
click to vote
BIRTHDAY
2012
Springer
14 years 6 days ago
2012
Springer
We introduce the use of asynchronous logic automata (ALA) for cryptography. ALA aligns the descriptions of hardware and software for portability, programmability, and scalability. ...
147
click to vote
CIVR
2009
Springer
15 years 11 months ago
2009
Springer
The GIST descriptor has recently received increasing attention in the context of scene recognition. In this paper we evaluate the search accuracy and complexity of the global GIST...