93 search results - page 7 / 19 » Classification trees for random tests and functional coverag... |
162
Voted
CATA
2009
15 years 1 months ago
2009
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...
119
Voted
CPC
1999
15 years 12 days ago
1999
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...
107
click to vote
JAL
2002
15 years 12 days ago
2002
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...
105
Voted
BMCBI
2010
15 years 26 days ago
2010
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...
CEC
2005
IEEE
15 years 6 months ago
2005
IEEE
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...