Sciweavers

495 search results - page 90 / 99
» Probability Trees
Sort
View
NIPS
1990
13 years 8 months ago
Bumptrees for Efficient Function, Constraint and Classification Learning
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
Stephen M. Omohundro
BMCBI
2008
200views more  BMCBI 2008»
13 years 7 months ago
Defining functional distances over Gene Ontology
Background: A fundamental problem when trying to define the functional relationships between proteins is the difficulty in quantifying functional similarities, even when well-stru...
Angela del Pozo, Florencio Pazos, Alfonso Valencia
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 7 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
BMCBI
2007
131views more  BMCBI 2007»
13 years 7 months ago
An improved method for identifying functionally linked proteins using phylogenetic profiles
Background: Phylogenetic profiles record the occurrence of homologs of genes across fully sequenced organisms. Proteins with similar profiles are typically components of protein c...
Shawn Cokus, Sayaka Mizutani, Matteo Pellegrini
TVLSI
2008
110views more  TVLSI 2008»
13 years 7 months ago
Thermal Switching Error Versus Delay Tradeoffs in Clocked QCA Circuits
Abstract--The quantum-dot cellular automata (QCA) model offers a novel nano-domain computing architecture by mapping the intended logic onto the lowest energy configuration of a co...
Sanjukta Bhanja, Sudeep Sarkar