2957 search results - page 259 / 592 » The Complexity of Polynomial-Time Approximation |
189
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
225
click to vote
DSN
2011
IEEE
14 years 6 months ago
2011
IEEE
—In this paper we extend the class of MAP queueing networks to include blocking models, which are useful to describe the performance of service instances which have a limited con...
187
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
165
click to vote
CVPR
2008
IEEE
16 years 8 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...
161
click to vote
ICIP
2001
IEEE
16 years 8 months ago
2001
IEEE
The problemof structurefrom motion (SFM)is to extract the three-dimensionalmodel of a moving scene from a sequence of images. Though two images are sufficient to produce a 3D reco...