1795 search results - page 195 / 359 » Search by strategy |
140
click to vote
CG
2002
Springer
15 years 6 months ago
2002
Springer
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...
184
click to vote
PAMI
2007
15 years 6 months ago
2007
—A new unsupervised forward orthogonal search (FOS) algorithm is introduced for feature selection and ranking. In the new algorithm, features are selected in a stepwise way, one ...
148
click to vote
ICIP
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper presents a fast algorithm for H.264 fractional motion estimation (ME). In H.264 ME is the most time consuming component. The ME process consists of two stages: integer ...
200
click to vote
CVPR
2011
IEEE
15 years 2 months ago
2011
IEEE
This paper presents a new adaptive graph-cut based move-making algorithm for energy minimization. Traditional move-making algorithms such as Expansion and Swap operate by searchin...
156
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
As more data becomes available for a given speech recognition task, the natural way to improve recognition accuracy is to train larger models. But, while this strategy yields mode...