1414 search results - page 137 / 283 » Randomness and Universal Machines |
141
click to vote
ASIAMS
2007
IEEE
15 years 7 months ago
2007
IEEE
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...
111
Voted
CSL
2010
Springer
15 years 1 months ago
2010
Springer
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
115
click to vote
ISCI
2007
15 years 17 days ago
2007
In this paper we study supervised and semi-supervised classification of e-mails. We consider two tasks: filing e-mails into folders and spam e-mail filtering. Firstly, in a sup...
106
Voted
ICPR
2006
IEEE
16 years 1 months ago
2006
IEEE
Two fast illumination invariant image retrieval methods for scenes comprising textured objects with variable illumination are introduced. Both methods are based on texture gradien...
102
Voted
ICPR
2004
IEEE
16 years 1 months ago
2004
IEEE
The maximum entropy principle is a cornerstone of FRAME (Filters, RAndom fields, and Maximum Entropy) model considered at times as a first-ever step towards a universal theory of ...