Sciweavers

1778 search results - page 5 / 356
» On the Power of the Randomized Iterate
Sort
View
88
Voted
PAMI
2008
198views more  PAMI 2008»
14 years 9 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors
Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation....
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...
CCA
2009
Springer
15 years 4 months ago
Random Iteration Algorithm for Graph-Directed Sets
Abstract. A random iteration algorithm for graph-directed sets is defined and discussed. Similarly to the Barnsley-Elton’s theorem, it is shown that almost all sequences obtaine...
Yoshiki Tsujii, Takakazu Mori, Mariko Yasugi, Hide...
EUSFLAT
2009
135views Fuzzy Logic» more  EUSFLAT 2009»
14 years 7 months ago
Exchanging Iterated Expectations of Random Upper Semicontinuous Functions: an application to decision theory
In this paper we present a procedure to deal with a kind of single-stage decision problems with imprecise utilities. In this type of problems the product measurability of the utili...
Miguel López-Díaz, Luis J. Rodr&iacu...
ICASSP
2007
IEEE
15 years 3 months ago
Markov Random Field Energy Minimization via Iterated Cross Entropy with Partition Strategy
This paper introduces a novel energy minimization method, namely iterated cross entropy with partition strategy (ICEPS), into the Markov random field theory. The solver, which is...
Jue Wu, Albert C. S. Chung
KDD
2009
ACM
239views Data Mining» more  KDD 2009»
15 years 10 months ago
Tell me something I don't know: randomization strategies for iterative data mining
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
Heikki Mannila, Kai Puolamäki, Markus Ojala, ...