1248 search results - page 198 / 250 » Decision Tree Grafting |
167
click to vote
BIBE
2007
IEEE
16 years 2 days ago
2007
IEEE
—High-throughput data such as microarrays make it possible to investigate the molecular-level mechanism of cancer more efficiently. Computational methods boost the microarray ana...
170
click to vote
CCS
2007
ACM
16 years 16 hour ago
2007
ACM
We present an efficient protocol for privacy-preserving evaluation of diagnostic programs, represented as binary decision trees or branching programs. The protocol applies a bran...
143
click to vote
CP
2007
Springer
16 years 12 hour ago
2007
Springer
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where t...
162
click to vote
EUROPAR
2007
Springer
16 years 6 hour ago
2007
Springer
An optimizing compiler has a hard time to generate a code which will perform at top speed for an arbitrary data set size. In general, the low level optimization process must take i...
169
click to vote
FASE
2007
Springer
16 years 5 hour ago
2007
Springer
We use 63 features extracted from sources such as versioning and issue tracking systems to predict defects in short time frames of two months. Our multivariate approach covers aspe...