2434 search results - page 85 / 487 » Algorithmic Randomness of Closed Sets |
140
click to vote
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
We propose an approach to include contextual features for labeling images, in which each pixel is assigned to one of a finite set of labels. The features are incorporated into a p...
140
click to vote
JMLR
2006
15 years 3 months ago
2006
This paper proposes a general probabilistic framework for shape-based modeling and classification of waveform data. A segmental hidden Markov model (HMM) is used to characterize w...
55
Voted
CORR
2010
Springer
15 years 25 days ago
2010
Springer
We address the non-redundant random generation of k words of length n from a context-free language. Additionally, we want to avoid a predefined set of words. We study the limits of...
139
click to vote
TSP
2008
15 years 3 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
193
click to vote
JCO
2006
15 years 3 months ago
2006
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...