250 search results - page 12 / 50 » Linear Text Segmentation using a Dynamic Programming Algorit... |
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
We consider the classical finite-state discounted Markovian decision problem, and we introduce a new policy iteration-like algorithm for finding the optimal state costs or Q-facto...
AAAI
2010
13 years 9 months ago
2010
Trial-based approaches offer an efficient way to solve singleagent MDPs and POMDPs. These approaches allow agents to focus their computations on regions of the environment they en...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
Sequence segmentation is a central problem in the analysis of sequential and time-series data. In this paper we introduce and we study a novel variation to the segmentation proble...
STACS
1992
Springer
13 years 12 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
ML
2002
ACM
13 years 7 months ago
2002
ACM
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...