1673 search results - page 79 / 335 » Taming the Dynamics of Distributed Data |
155
Voted
SARA
2007
Springer
15 years 10 months ago
2007
Springer
Several recent techniques for solving Markov decision processes use dynamic Bayesian networks to compactly represent tasks. The dynamic Bayesian network representation may not be g...
133
Voted
HPCC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We consider query execution strategies for object-oriented distributed databases. There are several scenarios of query decomposition, assuming that the corresponding quer...
142
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
Real-time resource scheduling is an important factor for improving the performance of cluster computing. In many distributed and parallel processing systems, particularly real-tim...
158
click to vote
APPT
2007
Springer
15 years 6 months ago
2007
Springer
Dynamic programming is a widely applied algorithm design technique in many areas such as computational biology and scientific computing. Typical applications using this technique a...
142
click to vote
PAKDD
2005
ACM
15 years 10 months ago
2005
ACM
Density-based clustering has the advantages for (i) allowing arbitrary shape of cluster and (ii) not requiring the number of clusters as input. However, when clusters touch each o...