Sciweavers

1923 search results - page 208 / 385
» Weighted Decision Trees
Sort
View
PG
2002
IEEE
15 years 11 months ago
A Divide and Conquer Algorithm for Triangle Mesh Connectivity Encoding
We propose a divide and conquer algorithm for the single resolution encoding of triangle mesh connectivity. Starting from a boundary edge we grow a zig-zag strip which divides the...
Ioannis P. Ivrissimtzis, Christian Rössl, Han...
PODC
2005
ACM
16 years 2 days ago
Proof labeling schemes
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
Amos Korman, Shay Kutten, David Peleg
GECCO
2005
Springer
160views Optimization» more  GECCO 2005»
16 years 1 days ago
Exploring relationships between genotype and oral cancer development through XCS
In medical research, being able to justify decisions is generally as important as taking the right ones. Interpretability is then one of the chief characteristics a learning algor...
Alessandro Passaro, Flavio Baronti, Valentina Magg...
BMCBI
2008
71views more  BMCBI 2008»
15 years 6 months ago
Examining the significance of fingerprint-based classifiers
Background: Experimental examinations of biofluids to measure concentrations of proteins or their fragments or metabolites are being explored as a means of early disease detection...
Brian T. Luke, Jack R. Collins
ENTCS
2006
134views more  ENTCS 2006»
15 years 6 months ago
Partial Order Reduction for Probabilistic Branching Time
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
Christel Baier, Pedro R. D'Argenio, Marcus Grö...