Sciweavers

1578 search results - page 8 / 316
» Algorithmic randomness of continuous functions
Sort
View
CVPR
2009
IEEE
15 years 6 months ago
P-Brush: Continuous Valued MRFs with Normed Pairwise Distributions for Image Segmentation
Interactive image segmentation traditionally involves the use of algorithms such as Graph Cuts or Random Walker. Common concerns with using Graph Cuts are metrication artifacts ...
Dheeraj Singaraju, Leo Grady, René Vidal
GECCO
2006
Springer
195views Optimization» more  GECCO 2006»
14 years 2 months ago
Studying XCS/BOA learning in Boolean functions: structure encoding and random Boolean functions
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...
Martin V. Butz, Martin Pelikan
CVPR
2007
IEEE
15 years 27 days ago
Utilizing Variational Optimization to Learn Markov Random Fields
Markov Random Field, or MRF, models are a powerful tool for modeling images. While much progress has been made in algorithms for inference in MRFs, learning the parameters of an M...
Marshall F. Tappen
CIE
2009
Springer
14 years 5 months ago
Computable Exchangeable Sequences Have Computable de Finetti Measures
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
Cameron E. Freer, Daniel M. Roy
TON
2010
157views more  TON 2010»
13 years 5 months ago
Random Access Game and Medium Access Control Design
We study the contention/interaction among wireless nodes and med -ium access control design in game theory framework. We define a general class of games, called random access game...
Lijun Chen, Steven H. Low, John C. Doyle