2588 search results - page 118 / 518 » Applications of Kolmogorov complexity to computable model th... |
103
click to vote
CVPR
2007
IEEE
16 years 3 months ago
2007
IEEE
In this paper we present a method for learning a curve model for detection and segmentation by closely integrating a hierarchical curve representation using generative and discrim...
128
click to vote
EMMCVPR
1999
Springer
15 years 6 months ago
1999
Springer
This paper considers the use of the EM-algorithm, combined with mean field theory, for parameter estimation in Markov random field models from unlabelled data. Special attention ...
125
click to vote
IWOCA
2009
Springer
15 years 8 months ago
2009
Springer
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...
121
Voted
WM
2003
15 years 3 months ago
2003
Techniques for computation on generalized diagrams are defined and the KM implications are explored. Descriptive Computing is presented and plan computation based on world models t...
104
click to vote
EICS
2010
ACM
15 years 3 months ago
2010
ACM
Modern User Interfaces (UI) must deal with the increasing complexity of applications in terms of functionality as well as new properties as plasticity. The plasticity of a UI deno...