Sciweavers

2771 search results - page 238 / 555
» A General Computational Treatment of the Comparative
Sort
View
JMLR
2006
125views more  JMLR 2006»
15 years 6 months ago
Linear Programming Relaxations and Belief Propagation - An Empirical Study
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
Chen Yanover, Talya Meltzer, Yair Weiss
CG
2002
Springer
15 years 6 months ago
Analytical methods for polynomial weighted convolution surfaces with various kernels
Convolution surface has the advantage of being crease-free and bulge-free over other kinds of implicit surfaces. Among the various types of skeletal elements, line segments can be...
Xiaogang Jin, Chiew-Lan Tai
JMLR
2010
115views more  JMLR 2010»
15 years 5 months ago
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwr...
PERCOM
2010
ACM
15 years 5 months ago
Concurrent scheduling in the Active Bat location system
Abstract—This paper looks at the scalability problems inherent in the Active Bat system: an outside-in ultrasonic location system. Such systems are typically associated with high...
Oliver Woodman, Robert Harle
BMVC
2010
15 years 4 months ago
Diffusion-based Regularisation Strategies for Variational Level Set Segmentation
Variational level set methods are formulated as energy minimisation problems, which are often solved by gradient-based optimisation methods, such as gradient descent. Unfortunatel...
Maximilian Baust, Darko Zikic, Nassir Navab