2609 search results - page 166 / 522 » Optimizing for parallelism and data locality |
98
Voted
ICPR
2008
IEEE
16 years 2 months ago
2008
IEEE
When a large amount of data are missing, or when multiple hidden nodes exist, learning parameters in Bayesian networks (BNs) becomes extremely difficult. This paper presents a lea...
94
Voted
ISLPED
1997
ACM
15 years 5 months ago
1997
ACM
Efficient use of an optimized memory hierarchy to exploit temporal locality in the memory accesses on array signals can have a very large impact on the power consumption in data ...
101
Voted
ICRA
2006
IEEE
15 years 6 months ago
2006
IEEE
— Our goal is polygonal approximation of laser range data points obtained by a mobile robot. The proposed approach provides a precise estimation of the number of model components...
128
Voted
KDD
2008
ACM
16 years 1 months ago
2008
ACM
The effectiveness of knowledge transfer using classification algorithms depends on the difference between the distribution that generates the training examples and the one from wh...
100
click to vote
ISVC
2007
Springer
15 years 7 months ago
2007
Springer
We present a method to speed up the computation of a high-quality data-dependent triangulation approximating an image using simulated annealing by probability distributions guided ...