Sciweavers

1594 search results - page 77 / 319
» Fast Prediction on a Tree
Sort
View
ICPPW
2002
IEEE
14 years 1 months ago
A Structural Framework for Modeling Multi-Stage Network Attacks
Incidents such as Solar Sunrise and Nimda demonstrate the need to expressively model distributed and complex network attacks. To protect information systems, system administrators...
Kristopher Daley, Ryan Larson, Jerald Dawkins
BMCBI
2008
115views more  BMCBI 2008»
13 years 8 months ago
Improving peptide-MHC class I binding prediction for unbalanced datasets
Background: Establishment of peptide binding to Major Histocompatibility Complex class I (MHCI) is a crucial step in the development of subunit vaccines and prediction of such bin...
Ana Paula Sales, Georgia D. Tomaras, Thomas B. Kep...
ICMLA
2008
13 years 9 months ago
Calibrating Random Forests
When using the output of classifiers to calculate the expected utility of different alternatives in decision situations, the correctness of predicted class probabilities may be of...
Henrik Boström
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
14 years 2 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl
IJFCS
2006
82views more  IJFCS 2006»
13 years 8 months ago
Routing Multiple Width Communications on the Circuit Switched Tree
Dynamically reconfigurable architectures offer extremely fast solutions to various problems. The Circuit Switched Tree (CST) is an important interconnect used to implement such ar...
Krishnendu Roy, Ramachandran Vaidyanathan, Jerry L...