2168 search results - page 367 / 434 » Randomized Algorithms and Complexity Theory |
128
click to vote
SPIRE
2010
Springer
15 years 1 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
142
click to vote
ICWS
2010
IEEE
15 years 28 days ago
2010
IEEE
A service-oriented application is composed of multiple web services to fulfill complex functionality that cannot be provided by individual web service. The combination of services ...
151
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
Alpha matting refers to the problem of softly extracting the foreground from an image. Given a trimap (specifying known foreground/background and unknown pixels), a straightforwar...
134
click to vote
CDC
2010
IEEE
14 years 10 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...
108
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We construct two families of deterministic sensing matrices where the columns are obtained by exponentiating codewords in the quaternary Delsarte-Goethals code DG(m, r). This meth...