2111 search results - page 10 / 423 » Understanding the Yarowsky Algorithm |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
The cornerstone of any algorithm computing all repetitions in a string of length n in O(n) time is the fact that the number of runs (or maximal repetitions) is O(n). We give a simp...
MIR
2005
ACM
14 years 3 months ago
2005
ACM
We address evaluation of image understanding and retrieval large scale image data in the context of three evaluation projects. The first project is a comprehensive strategy for e...
TACAS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Weakly-typed languages such as Cobol often force programrepresent distinct data abstractions using the same low-level physical type. In this paper, we describe a techniqu...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Simplified forms of the particle swarm algorithm are very beneficial in contributing to understanding of what makes a PSO swarm function in the way that it does. One of these form...
IJCAI
2003
13 years 11 months ago
2003
Markov decision processes (MDPs) and contingency planning (CP) are two widely used approaches to planning under uncertainty. MDPs are attractive because the model is extremely gen...