49 search results - page 6 / 10 » On Fast and Approximate Attack Tree Computations |
NAACL
2010
14 years 7 months ago
2010
Previous work on dependency parsing used various kinds of combination models but a systematic analysis and comparison of these approaches is lacking. In this paper we implemented ...
EGH
2010
Springer
14 years 7 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
ISBI
2004
IEEE
15 years 10 months ago
2004
IEEE
The techniques described in this paper allow multiscale photon-limited image reconstruction methods to be implemented with significantly less computational complexity than previou...
105
click to vote
HPDC
2007
IEEE
15 years 3 months ago
2007
IEEE
Adapting to the network is the key to achieving high performance for communication-intensive applications, including scientific computing, data intensive computing, and multicast...
3DIM
2007
IEEE
15 years 3 months ago
2007
IEEE
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...