16430 search results - page 398 / 3286 » On Computable Tree Functions |
176
click to vote
CCS
2007
ACM
16 years 1 months ago
2007
ACM
Researchers have previously looked into the problem of determining if a given set of security hardening measures can effectively make a networked system secure. Many of them also...
202
click to vote
PAKDD
2007
ACM
16 years 28 days ago
2007
ACM
In this paper, we study the privacy-preserving decision tree building problem on vertically partitioned data. We made two contributions. First, we propose a novel hybrid approach, ...
166
click to vote
RT
1999
Springer
15 years 11 months ago
1999
Springer
This paper presents a ray tracer that facilitates near-interactive scene editing with incremental rendering; the user can edit the scene both by manipulating objects and by changin...
144
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typica...
187
click to vote
DAC
1989
ACM
15 years 11 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...