2434 search results - page 24 / 487 » Algorithmic Randomness of Closed Sets |
118
click to vote
FOCS
1999
IEEE
15 years 6 months ago
1999
IEEE
We study the phenomenon of cognitive learning from an algorithmic standpoint. How does the brain effectively learn concepts from a small number of examples despite the fact that e...
109
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...
144
click to vote
ACST
2006
15 years 3 months ago
2006
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
163
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
Many computer vision problems can be formulated in
a Bayesian framework with Markov Random Field (MRF)
or Conditional Random Field (CRF) priors. Usually, the
model assumes that ...
137
click to vote
BMCBI
2010
15 years 2 months ago
2010
Background: Data generated using `omics' technologies are characterized by high dimensionality, where the number of features measured per subject vastly exceeds the number of...