2254 search results - page 356 / 451 » Computing the minimal covering set |
167
click to vote
DCG
2000
15 years 5 months ago
2000
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...
171
click to vote
ICRA
2010
IEEE
15 years 4 months ago
2010
IEEE
— In a previous paper [3], we proposed a new way to achieve visual servoing. Rather than minimizing the error between the position of two set of geometric features, we proposed t...
145
click to vote
BMVC
2010
15 years 4 months ago
2010
In this paper, we propose a novel manifold alignment method by learning the underlying common manifold with supervision of corresponding data pairs from different observation sets...
163
click to vote
IPPS
2010
IEEE
15 years 3 months ago
2010
IEEE
Multi-core organizations increasingly support multiple threads per core. Threads on a core usually share a single first-level data cache, so thread schedulers must try to minimize ...
228
click to vote
PKDD
2010
Springer
15 years 3 months ago
2010
Springer
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...