391 search results - page 14 / 79 » Constructive Equivalence Relations on Computable Probability... |
AML
2006
15 years 1 months ago
2006
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
122
click to vote
BMCBI
2005
15 years 1 months ago
2005
Background: Detecting homology between remotely related protein families is an important problem in computational biology since the biological properties of uncharacterized protei...
CORR
2010
Springer
15 years 1 months ago
2010
Springer
A pseudorandom point in an ergodic dynamical system over a computable metric space is a point which is computable but its dynamics has the same statistical behavior of a typical po...
153
click to vote
LICS
2000
IEEE
15 years 5 months ago
2000
IEEE
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
110
click to vote
CVPR
2003
IEEE
16 years 3 months ago
2003
IEEE
We develop a multi-class object detection framework whose core component is a nearest neighbor search over object part classes. The performance of the overall system is critically...