Sciweavers

24 search results - page 3 / 5
» The Cross Entropy Method for Fast Policy Search
Sort
View
IEEEIAS
2009
IEEE
14 years 2 months ago
Octagonal Search Algorithm with Early Termination for Fast Motion Estimation on H.264
: An adaptive threshold for early termination is proposed in this paper to enhance the cross octagonal search algorithm (COSA)[1]. In block motion estimation, search patterns have ...
Zhaopeng Cui, Dujuan Wang, Guang Jiang, Chengke Wu
EMNLP
2010
13 years 5 months ago
An Efficient Algorithm for Unsupervised Word Segmentation with Branching Entropy and MDL
This paper proposes a fast and simple unsupervised word segmentation algorithm that utilizes the local predictability of adjacent character sequences, while searching for a leaste...
Valentin Zhikov, Hiroya Takamura, Manabu Okumura
ICML
2001
IEEE
14 years 8 months ago
Direct Policy Search using Paired Statistical Tests
Direct policy search is a practical way to solve reinforcement learning problems involving continuous state and action spaces. The goal becomes finding policy parameters that maxi...
Malcolm J. A. Strens, Andrew W. Moore
CIVR
2008
Springer
165views Image Analysis» more  CIVR 2008»
13 years 9 months ago
Balancing thread based navigation for targeted video search
Various query methods for video search exist. Because of the semantic gap each method has its limitations. We argue that for effective retrieval query methods need to be combined ...
Ork de Rooij, Cees G. M. Snoek, Marcel Worring
SIGIR
2006
ACM
14 years 1 months ago
Type less, find more: fast autocompletion search with a succinct index
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
Holger Bast, Ingmar Weber