1362 search results - page 51 / 273 » Means, Correlations and Bounds |
102
click to vote
SODA
2008
ACM
15 years 1 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
ICPR
2004
IEEE
16 years 28 days ago
2004
IEEE
We deal with the problem of obtaining rigorous bounds to the position of 3-D points computed by stereo triangulation when both the camera matrix and the image points are affected ...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
An analog source is to be transmitted across a Gaussian channel in more than one channel use per source symbol. This paper derives a lower bound on the asymptotic mean squared erro...
IJCGA
2006
14 years 12 months ago
2006
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
102
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
One of the difficulties in calculating the capacity of certain Poisson channels is that H(), the entropy of the Poisson distribution with mean , is not available in a simple form. ...