1214 search results - page 34 / 243 » Labeling Points with Weights |
176
click to vote
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
The most commonly used learning algorithm for restricted Boltzmann machines is contrastive divergence which starts a Markov chain at a data point and runs the chain for only a few...
174
click to vote
ICIP
1998
IEEE
16 years 7 months ago
1998
IEEE
We present a modi cation of the well-known snakes algorithm for extracting contours in noisy images. Our modi cation addresses the issues of selection of the control points on an ...
151
click to vote
DM
2008
15 years 6 months ago
2008
We introduce random recursive trees, where deterministically weights are attached to the edges according to the labeling of the trees. We will give a bijection between recursive t...
172
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
163
click to vote
IVS
2007
15 years 6 months ago
2007
This paper describes a fast approach to automatic point label de-confliction on interactive maps. The general Map Labeling problem is NP-hard and has been the subject of much stud...