14548 search results - page 66 / 2910 » The Optimal Path-Matching Problem |
NETWORKS
2002
13 years 9 months ago
2002
An n-dimensional hierarchical cubic network (denoted by HCN(n)) contains 2 n n-dimensional hypercubes. The diameter of the HCN(n), which is equal to n+(n+1)/3+1, is about two-thir...
TIT
2011
13 years 5 months ago
2011
Signal-to-noise (SNR) ratio is commonly regarded as a reliable measure of the performance of wireless communication systems. Knowledge of the fundamental properties of the feasibl...
JMLR
2010
13 years 4 months ago
2010
Bandit algorithms are concerned with trading exploration with exploitation where a number of options are available but we can only learn their quality by experimenting with them. ...
CVPR
2006
IEEE
15 years 13 hour ago
2006
IEEE
In this paper we propose a practical and efficient method for finding the globally optimal solution to the problem of pose estimation of a known object. We present a framework tha...
SIAMJO
2010
13 years 4 months ago
2010
Abstract: In this paper, we study KKT optimality conditions for constrained nonlinear programming problems and strong and Mordukhovich stationarities for mathematical