583 search results - page 112 / 117 » Efficient algorithms for constructing decision trees with co... |
KDD
2007
ACM
15 years 10 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
DAC
2000
ACM
15 years 10 months ago
2000
ACM
eously demand shorter and less costly design cycles. Designing at higher levels of abstraction makes both objectives achievable, but enabling techniques like behavioral synthesis h...
113
click to vote
DAGSTUHL
2010
14 years 11 months ago
2010
We apply Knoll et al.'s algorithm [9] to interactively ray-cast constructive solid geometry (CSG) objects of arbitrary primitives represented as implicit functions. Whereas m...
STOC
2001
ACM
15 years 10 months ago
2001
ACM
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
BMCBI
2005
14 years 9 months ago
2005
Background: Development of robust and efficient methods for analyzing and interpreting high dimension gene expression profiles continues to be a focus in computational biology. Th...