4894 search results - page 690 / 979 » The Guarding Problem - Complexity and Approximation |
150
Voted
CISS
2007
IEEE
15 years 6 months ago
2007
IEEE
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
113
Voted
COSIT
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. This paper addresses the problem of merging qualitative constraint networks (QCNs) defined on different qualitative formalisms. Our model is restricted to formalisms wher...
142
Voted
ANNPR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. In our previous work we have shown that Mahalanobis kernels are useful for support vector classifiers both from generalization ability and model selection speed. In this ...
129
Voted
APNOMS
2006
Springer
15 years 6 months ago
2006
Springer
In this paper, we propose the localized adaptive QoS routing scheme using POMDP(partially observable Markov Decision Processes) and Exploration Bonus. In order to deal with POMDP p...
132
click to vote
COCOON
2006
Springer
15 years 6 months ago
2006
Springer
We present an efficient reduction mapping undirected graphs G with n = 2k vertices for integers k to tables of partially specified Boolean functions g : {0, 1}4k+1 {0, 1, } so tha...