Sciweavers

3244 search results - page 301 / 649
» On convex complexity measures
Sort
View
LOGCOM
2007
89views more  LOGCOM 2007»
15 years 6 months ago
Algorithmic Randomness of Closed Sets
We investigate notions of randomness in the space C[2N ] of nonempty closed subsets of {0, 1}N . A probability measure is given and a version of the Martin-L¨of test for randomne...
George Barmpalias, Paul Brodhead, Douglas Cenzer, ...
CANDC
2004
ACM
15 years 6 months ago
Cycling in ecological networks: Finn's index revisited
A chief cybernetic feature of natural living systems is the recycling of nutrients, which tends to enhance stability and is one of the principal causes of ecosystem complexity. In...
Stefano Allesina, Robert E. Ulanowicz
CORR
2000
Springer
91views Education» more  CORR 2000»
15 years 6 months ago
Algorithmic Theories of Everything
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
Jürgen Schmidhuber
IJCV
1998
153views more  IJCV 1998»
15 years 6 months ago
Rational Filters for Passive Depth from Defocus
A fundamental problem in depth from defocus is the measurement of relative defocus between images. The performance of previously proposed focus operators are inevitably sensitive t...
Masahiro Watanabe, Shree K. Nayar
PR
2007
189views more  PR 2007»
15 years 6 months ago
Information cut for clustering using a gradient descent approach
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
Robert Jenssen, Deniz Erdogmus, Kenneth E. Hild II...