Sciweavers

22 search results - page 2 / 5
» Geometric Constructions with Discretized Random Variables
Sort
View
CIE
2006
Springer
13 years 9 months ago
Forcing with Random Variables and Proof Complexity
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
Jan Krajícek
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
14 years 2 months ago
Efficient Broadcast on Random Geometric Graphs
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
Milan Bradonji, Robert Elsässer, Tobias Friedrich...
CVPR
2010
IEEE
13 years 8 months ago
Ray Markov Random Fields for Image-Based 3D Modeling: Model and Efficient Inference
In this paper, we present an approach to multi-view image-based 3D reconstruction by statistically inversing the ray-tracing based image generation process. The proposed algorithm...
Shubao Liu, David Cooper
ICA
2007
Springer
13 years 9 months ago
Conjugate Gamma Markov Random Fields for Modelling Nonstationary Sources
In modelling nonstationary sources, one possible strategy is to define a latent process of strictly positive variables to model variations in second order statistics of the underly...
Ali Taylan Cemgil, Onur Dikmen
JMLR
2012
11 years 7 months ago
Sample Complexity of Composite Likelihood
We present the first PAC bounds for learning parameters of Conditional Random Fields [12] with general structures over discrete and real-valued variables. Our bounds apply to com...
Joseph K. Bradley, Carlos Guestrin