192 search results - page 26 / 39 » On-Demand Bound Computation for Best-First Constraint Optimi... |
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
SIAMCOMP
2000
14 years 9 months ago
2000
We study the problem of computing the free space F of a simple legged robot called the spider robot. The body of this robot is a single point and the legs are attached to the body....
96
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Recent work has shown how information theory extends conventional full-rationality game theory to allow bounded rational agents. The associated mathematical framework can be used ...
103
Voted
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Abstract—Widely distributed multiple radar architectures offer parameter estimation improvement for target localization. For a large number of radars, the achievable localization...
101
click to vote
AUTOMATICA
2008
14 years 9 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...