2745 search results - page 12 / 549 » A fast algorithm for computing large Fibonacci numbers |
PAMI
2008
14 years 9 months ago
2008
We consider the problem of learning a ranking function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on the training data. Relying on an -accurate approxim...
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
In patch-based object recognition, using a compact visual codebook can boost computational efficiency and reduce memory cost. Nevertheless, compared with a large-sized codebook, it...
82
Voted
ICDCS
2000
IEEE
15 years 1 months ago
2000
IEEE
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
124
click to vote
CVPR
2011
IEEE
14 years 7 months ago
2011
IEEE
We analyze the computational problem of multi-object tracking in video sequences. We formulate the problem using a cost function that requires estimating the number of tracks, as ...
133
click to vote
SIAMSC
2011
14 years 4 months ago
2011
We consider the problem of estimating the uncertainty in large-scale linear statistical inverse problems with high-dimensional parameter spaces within the framework of Bayesian inf...