433 search results - page 70 / 87 » Optimal Segmentation of Random Sequences |
PAMI
2010
14 years 10 months ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
192
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
106
click to vote
ICML
2001
IEEE
16 years 15 days ago
2001
IEEE
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...
111
click to vote
WIOPT
2011
IEEE
14 years 3 months ago
2011
IEEE
—We consider the minimization of the transmission completion time with a battery limited energy harvesting transmitter in a two-user AWGN broadcast channel. The transmitter has ...
BMCBI
2008
14 years 11 months ago
2008
Background: We consider the discovery of recombinant segments jointly with their origins within multilocus DNA sequences from bacteria representing heterogeneous populations of fa...