1591 search results - page 127 / 319 » Random lifts of graphs |
201
click to vote
ECCV
2008
Springer
16 years 4 months ago
2008
Springer
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
176
click to vote
EMMCVPR
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. This paper presents a Bayesian inference algorithm for image layer representation [26], 2.1D sketch [6], with mixed Markov random field. 2.1D sketch is an very important...
200
click to vote
TMC
2011
15 years 1 months ago
2011
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
187
click to vote
IM
2007
15 years 6 months ago
2007
Abstract. The web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to ano...
181
click to vote
EMNLP
2010
15 years 4 months ago
2010
We describe a new scalable algorithm for semi-supervised training of conditional random fields (CRF) and its application to partof-speech (POS) tagging. The algorithm uses a simil...