Sciweavers

10106 search results - page 1673 / 2022
» Algorithm Selection and Scheduling
Sort
View
DLOG
2001
15 years 8 months ago
Using Lazy Unfolding for the Computation of Least Common Subsumers
For description logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the concept descrip...
Anni-Yasmin Turhan, Ralf Molitor
IJCAI
1997
15 years 8 months ago
Is Nonparametric Learning Practical in Very High Dimensional Spaces?
Many of the challenges faced by the £eld of Computational Intelligence in building intelligent agents, involve determining mappings between numerous and varied sensor inputs and ...
Gregory Z. Grudic, Peter D. Lawrence
BMCBI
2008
84views more  BMCBI 2008»
15 years 6 months ago
poolHiTS: A Shifted Transversal Design based pooling strategy for high-throughput drug screening
Background: A key goal of drug discovery is to increase the throughput of small molecule screens without sacrificing screening accuracy. High-throughput screening (HTS) in drug di...
Raghunandan M. Kainkaryam, Peter J. Woolf
BMCBI
2007
197views more  BMCBI 2007»
15 years 6 months ago
Boolean networks using the chi-square test for inferring large-scale gene regulatory networks
Background: Boolean network (BN) modeling is a commonly used method for constructing gene regulatory networks from time series microarray data. However, its major drawback is that...
Haseong Kim, Jae K. Lee, Taesung Park
BMCBI
2008
86views more  BMCBI 2008»
15 years 6 months ago
Subfamily specific conservation profiles for proteins based on n-gram patterns
Background: A new algorithm has been developed for generating conservation profiles that reflect the evolutionary history of the subfamily associated with a query sequence. It is ...
John K. Vries, Xiong Liu
« Prev « First page 1673 / 2022 Last » Next »