Sciweavers

1376 search results - page 53 / 276
» Searching Trees: An Essay
Sort
View
EGC
2009
Springer
14 years 9 months ago
A Bayes Evaluation Criterion for Decision Trees
We present a new evaluation criterion for the induction of decision trees. We exploit a parameter-free Bayesian approach and propose an analytic formula for the evaluation of the p...
Nicolas Voisine, Marc Boullé, Carine Hue
TSP
2008
99views more  TSP 2008»
14 years 11 months ago
Sphere Decoding With a Probabilistic Tree Pruning
In this paper, we present a near ML-achieving sphere decoding algorithm that reduces the number of search operations in the sphere-constrained search. Specifically, by adding a pro...
Byonghyo Shim, Insung Kang
SIGMETRICS
2004
ACM
106views Hardware» more  SIGMETRICS 2004»
15 years 5 months ago
Performance analysis of BSTs in system software
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
Ben Pfaff
CCS
2000
ACM
15 years 3 months ago
Accountable certificate management using undeniable attestations
This paper initiates a study of accountable certificate management methods, necessary to support long-term authenticity of digital documents. Our main contribution is a model for ...
Ahto Buldas, Peeter Laud, Helger Lipmaa
JBI
2006
14 years 11 months ago
Support versus corroboration
Numerous metrics have been developed that attempt to assess the reliability of phylogenetic trees. Several of these commonly used measures of tree and tree branch support are desc...
Mary G. Egan