Sciweavers

458 search results - page 67 / 92
» Optimal Conclusive Sets for Comparator Networks
Sort
View
PADS
2004
ACM
14 years 2 months ago
Simulation Validation Using Direct Execution of Wireless Ad-Hoc Routing Protocols
Computer simulation is the most common approach to studying wireless ad-hoc routing algorithms. The results, however, are only as good as the models the simulation uses. One shoul...
Jason Liu, Yougu Yuan, David M. Nicol, Robert S. G...
NDJFL
2010
13 years 3 months ago
Polyadic Quantification via Denoting Concepts
The question of the origin of polyadic expressivity is explored and the results are brought to bear on Bertrand Russell's 1903 theory of denoting concepts, which is the main o...
Ori Simchen
BMCBI
2010
150views more  BMCBI 2010»
13 years 9 months ago
AMS 3.0: prediction of post-translational modifications
Background: We present here the recent update of AMS algorithm for identification of post-translational modification (PTM) sites in proteins based only on sequence information, us...
Subhadip Basu, Dariusz Plewczynski
BMCBI
2010
106views more  BMCBI 2010»
13 years 9 months ago
Predicting MHC class I epitopes in large datasets
Background: Experimental screening of large sets of peptides with respect to their MHC binding capabilities is still very demanding due to the large number of possible peptide seq...
Kirsten Roomp, Iris Antes, Thomas Lengauer
BMCBI
2008
179views more  BMCBI 2008»
13 years 9 months ago
Building pathway clusters from Random Forests classification using class votes
Background: Recent years have seen the development of various pathway-based methods for the analysis of microarray gene expression data. These approaches have the potential to bri...
Herbert Pang, Hongyu Zhao