1023 search results - page 60 / 205 » Graph model selection using maximum likelihood |
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
We focus on the detection of orthogonal vanishing points using line segments extracted from a single view, and using these for camera self-calibration. Recent methods view this pr...
ENTCS
2007
13 years 8 months ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
COLT
2010
Springer
13 years 6 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
JMLR
2012
11 years 11 months ago
2012
We consider the task of estimating, from observed data, a probabilistic model that is parameterized by a finite number of parameters. In particular, we are considering the situat...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...