209 search results - page 19 / 42 » The Computational Complexity of Weak Saddles |
STOC
2005
ACM
14 years 7 months ago
2005
ACM
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
ECCV
2010
Springer
12 years 1 months ago
2010
Springer
Hough voting methods efficiently handle the high complexity of multiscale,
category-level object detection in cluttered scenes. The primary weakness
of this approach is however t...
SODA
1992
ACM
13 years 8 months ago
1992
ACM
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Methods for expanding the dynamic range of digital photographs by combining images taken at different exposures have recently received a lot of attention. Current techniques assum...
CVPR
2007
IEEE
14 years 1 months ago
2007
IEEE
Image matting is the problem of determining for each pixel in an image whether it is foreground, background, or the mixing parameter, ”alpha”, for those pixels that are a mixt...