2570 search results - page 264 / 514 » Fast Algorithms For The Computation Of Ranklets |
208
click to vote
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
Blind image deconvolution is an ill-posed problem that requires regularization to solve. However, many common forms of image prior used in this setting have a major drawback in th...
152
click to vote
ACCV
2010
Springer
14 years 11 months ago
2010
Springer
Accurate localization of the salient object from an image is a difficult problem when the saliency map is noisy and incomplete. A fast approach to detect salient objects from image...
147
click to vote
ACL
2011
14 years 7 months ago
2011
We introduce synchronous tree adjoining grammars (TAG) into tree-to-string translation, which converts a source tree to a target string. Without reconstructing TAG derivations exp...
159
click to vote
SAGT
2010
Springer
15 years 2 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
159
click to vote
ICCV
2003
IEEE
16 years 5 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...