Sciweavers

1578 search results - page 71 / 316
» Algorithmic randomness of continuous functions
Sort
View
BMCBI
2007
160views more  BMCBI 2007»
15 years 6 months ago
Convergent algorithms for protein structural alignment
Background: Many algorithms exist for protein structural alignment, based on internal protein coordinates or on explicit superposition of the structures. These methods are usually...
Leandro Martínez, Roberto Andreani, Jos&eac...
ESOP
2011
Springer
14 years 10 months ago
Measure Transformer Semantics for Bayesian Machine Learning
Abstract. The Bayesian approach to machine learning amounts to inferring posterior distributions of random variables from a probabilistic model of how the variables are related (th...
Johannes Borgström, Andrew D. Gordon, Michael...
FOIKS
2008
Springer
16 years 3 months ago
Cost-minimising strategies for data labelling : optimal stopping and active learning
Supervised learning deals with the inference of a distribution over an output or label space $\CY$ conditioned on points in an observation space $\CX$, given a training dataset $D$...
Christos Dimitrakakis, Christian Savu-Krohn
SPAA
1997
ACM
15 years 11 months ago
Accessing Nearby Copies of Replicated Objects in a Distributed Environment
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
C. Greg Plaxton, Rajmohan Rajaraman, Andréa...
FOCS
1999
IEEE
15 years 11 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson