Sciweavers

1214 search results - page 21 / 243
» Labeling Points with Weights
Sort
View
ICML
2006
IEEE
16 years 6 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
FSTTCS
2004
Springer
15 years 11 months ago
Minimum Weight Pseudo-Triangulations
In this note we discuss some structural properties of minimum weight (pointed) pseudo-triangulations.
Joachim Gudmundsson, Christos Levcopoulos
ICMLA
2008
15 years 7 months ago
A Weighted Distance Measure for Calculating the Similarity of Sparsely Distributed Trajectories
This article presents a method for the calculating similarity of two trajectories. The method is especially designed for a situation where the points of the trajectories are distr...
Pekka Siirtola, Perttu Laurinen, Juha Röning
APPROX
2005
Springer
131views Algorithms» more  APPROX 2005»
15 years 11 months ago
Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems
Abstract. In this paper we introduce a new technique for approximation schemes for geometrical optimization problems. As an example problem, we consider the following variant of th...
Jan Remy, Angelika Steger
162
Voted
CIKM
2005
Springer
15 years 11 months ago
QED: a novel quaternary encoding to completely avoid re-labeling in XML updates
The method of assigning labels to the nodes of the XML tree is called a labeling scheme. Based on the labels only, both ordered and un-ordered queries can be processed without acc...
Changqing Li, Tok Wang Ling