3020 search results - page 124 / 604 » Optimal partition trees |
166
click to vote
SIGMOD
2002
ACM
16 years 6 months ago
2002
ACM
Physical database design is important for query performance in a shared-nothing parallel database system, in which data is horizontally partitioned among multiple independent node...
203
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper is concerned with developing an information-theoretic framework to aggregate the state space of a Hidden Markov Model (HMM) on discrete state and observation spaces. The...
161
click to vote
HM
2007
Springer
16 years 18 days ago
2007
Springer
For the NP-hard Optimum Communication Spanning Tree (OCST) problem a cost minimizing spanning tree has to be found, where the cost depends on the communication volume between each ...
180
click to vote
ISPEC
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In this paper we address the problem of inefficiency of exact attack tree computations. We propose several implementation-level optimizations and introduce a genetic algo...
198
click to vote
SI3D
1995
ACM
15 years 10 months ago
1995
ACM
This paper presents an algorithm for shadow calculation in dynamic polyhedral scenes illuminated by point light sources. It is based on a modi cation of Shadow Volume Binary Space...