Sciweavers

278 search results - page 45 / 56
» The one-way function based on computational uncertainty prin...
Sort
View
BMCBI
2010
108views more  BMCBI 2010»
14 years 10 months ago
An intuitionistic approach to scoring DNA sequences against transcription factor binding site motifs
Background: Transcription factors (TFs) control transcription by binding to specific regions of DNA called transcription factor binding sites (TFBSs). The identification of TFBSs ...
Fernando Garcia-Alcalde, Armando Blanco, Adrian J....
ECCV
2010
Springer
15 years 3 months ago
Robust Multi-View Boosting with Priors
Many learning tasks for computer vision problems can be described by multiple views or multiple features. These views can be exploited in order to learn from unlabeled data, a.k.a....
POPL
1989
ACM
15 years 2 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
ROBOCUP
2005
Springer
109views Robotics» more  ROBOCUP 2005»
15 years 3 months ago
Using the Max-Plus Algorithm for Multiagent Decision Making in Coordination Graphs
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
Jelle R. Kok, Nikos A. Vlassis
NIPS
2001
14 years 11 months ago
MIME: Mutual Information Minimization and Entropy Maximization for Bayesian Belief Propagation
Bayesian belief propagation in graphical models has been recently shown to have very close ties to inference methods based in statistical physics. After Yedidia et al. demonstrate...
Anand Rangarajan, Alan L. Yuille