14548 search results - page 66 / 2910 » The Optimal Path-Matching Problem |
130
click to vote
NETWORKS
2002
15 years 4 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...
114
click to vote
TIT
2011
14 years 11 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...
155
click to vote
JMLR
2010
14 years 11 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. ...
142
click to vote
CVPR
2006
IEEE
16 years 6 months 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...
109
click to vote
SIAMJO
2010
14 years 11 months ago
2010
Abstract: In this paper, we study KKT optimality conditions for constrained nonlinear programming problems and strong and Mordukhovich stationarities for mathematical