Sciweavers

895 search results - page 70 / 179
» Approximate convex decomposition
Sort
View
ICML
2006
IEEE
15 years 10 months ago
Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
Pradeep D. Ravikumar, John D. Lafferty
FSS
2010
111views more  FSS 2010»
14 years 8 months ago
The geometry of consonant belief functions: Simplicial complexes of necessity measures
In this paper we extend the geometric approach to the theory of evidence in order to include the class of necessity measures, represented on a finite domain of “frame” by con...
Fabio Cuzzolin
JCO
2010
169views more  JCO 2010»
14 years 8 months ago
An almost four-approximation algorithm for maximum weight triangulation
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
Shiyan Hu
ICIP
2005
IEEE
15 years 11 months ago
Video summarization for multiple path communication
For video communications over wireless ad hoc networks, multiple paths with limited bandwidth are common. It therefore presents new challenges to the video encoding. In this paper...
Zhu Li, Guido M. Schuster, Aggelos K. Katsaggelos
ISIPTA
2003
IEEE
145views Mathematics» more  ISIPTA 2003»
15 years 3 months ago
An Extended Set-valued Kalman Filter
Set-valued estimation offers a way to account for imprecise knowledge of the prior distribution of a Bayesian statistical inference problem. The set-valued Kalman filter, which p...
Darryl Morrell, Wynn C. Stirling