Sciweavers

93 search results - page 7 / 19
» Classification trees for random tests and functional coverag...
Sort
View
CATA
2009
14 years 10 months ago
Nearest Shrunken Centroid as Feature Selection of Microarray Data
The nearest shrunken centroid classifier uses shrunken centroids as prototypes for each class and test samples are classified to belong to the class whose shrunken centroid is nea...
Myungsook Klassen, Nyunsu Kim
CPC
1999
105views more  CPC 1999»
14 years 9 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
JAL
2002
113views more  JAL 2002»
14 years 9 months ago
A multivariate view of random bucket digital search trees
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
Friedrich Hubalek, Hsien-Kuei Hwang, William Lew, ...
BMCBI
2010
119views more  BMCBI 2010»
14 years 9 months ago
Functional classification of proteins based on projection of amino acid sequences: application for prediction of protein kinase
Background: The knowledge about proteins with specific interaction capacity to the protein partners is very important for the modeling of cell signaling networks. However, the exp...
Boris Sobolev, Dmitry Filimonov, Alexey Lagunin, A...
CEC
2005
IEEE
15 years 3 months ago
Dynamic power minimization during combinational circuit testing as a traveling salesman problem
Testing of VLSI circuits can cause generation of excessive heat which can damage the chips under test. In the random testing environment, high-performance CMOS circuits consume sig...
Artem Sokolov, Alodeep Sanyal, L. Darrell Whitley,...