Sciweavers

3378 search results - page 434 / 676
» Learning in Friedberg Numberings
Sort
View
ICML
2010
IEEE
15 years 7 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio
166
Voted
ICPR
2010
IEEE
15 years 7 months ago
A Probabilistic Language Model for Hand Drawings
Probabilistic language models are critical to applications in natural language processing that include speech recognition, optical character recognition, and interfaces for text e...
Abdullah Akce, Timothy Bretl
169
Voted
COGSCI
2010
80views more  COGSCI 2010»
15 years 6 months ago
The Interactive Evolution of Human Communication Systems
This paper compares two explanations of the process by which human communication systems evolve: iterated learning and social collaboration. It then reports an experiment testing ...
Nicolas Fay, Simon Garrod, Leo Roberts, Nik Swobod...
BMCBI
2006
180views more  BMCBI 2006»
15 years 6 months ago
Building multiclass classifiers for remote homology detection and fold recognition
Motivation Protein remote homology prediction and fold recognition are central problems in computational biology. Supervised learning algorithms based on support vector machines a...
Huzefa Rangwala, George Karypis
BMCBI
2006
118views more  BMCBI 2006»
15 years 6 months ago
Predicting the effect of missense mutations on protein function: analysis with Bayesian networks
Background: A number of methods that use both protein structural and evolutionary information are available to predict the functional consequences of missense mutations. However, ...
Chris J. Needham, James R. Bradford, Andrew J. Bul...