377 search results - page 35 / 76 » A Fast Heuristic Algorithm for a Probe Mapping Problem |
ICML
2006
IEEE
14 years 9 months ago
2006
IEEE
We propose efficient particle smoothing methods for generalized state-spaces models. Particle smoothing is an expensive O(N2 ) algorithm, where N is the number of particles. We ov...
CIAC
2000
Springer
14 years 1 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
ICS
1993
Tsinghua U.
14 years 23 days ago
1993
Tsinghua U.
Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the ...
ICDM
2005
IEEE
14 years 2 months ago
2005
IEEE
In this paper we address the problem of learning the Markov blanket of a quantity from data in an efficient manner. Markov blanket discovery can be used in the feature selection ...
GECCO
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. The dense wavelength division multiplexing (DWDM) technique has been developed to provide a tremendous number of wavelengths/channels in an optical fiber. In the multi-c...