Sciweavers

3143 search results - page 267 / 629
» Minimization of entropy functionals
Sort
View
BMCBI
2008
97views more  BMCBI 2008»
15 years 4 months ago
Comparison study on k-word statistical measures for protein: From sequence to 'sequence space'
Background: Many proposed statistical measures can efficiently compare protein sequence to further infer protein structure, function and evolutionary information. They share the s...
Qi Dai, Tian-Ming Wang
BMCBI
2006
103views more  BMCBI 2006»
15 years 4 months ago
Domain-based small molecule binding site annotation
Background: Accurate small molecule binding site information for a protein can facilitate studies in drug docking, drug discovery and function prediction, but small molecule bindi...
Kevin A. Snyder, Howard J. Feldman, Michel Dumonti...
JMLR
2008
159views more  JMLR 2008»
15 years 4 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
ML
2008
ACM
15 years 4 months ago
Incremental exemplar learning schemes for classification on embedded devices
Although memory-based classifiers offer robust classification performance, their widespread usage on embedded devices is hindered due to the device's limited memory resources...
Ankur Jain, Daniel Nikovski
CPC
1999
105views more  CPC 1999»
15 years 4 months ago
Total Path Length For Random Recursive Trees
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
Robert P. Dobrow, James Allen Fill