1214 search results - page 41 / 243 » Labeling Points with Weights |
158
click to vote
IDA
2009
Springer
16 years 25 days ago
2009
Springer
Abstract. The label switching problem, the unidentifiability of the permutation of clusters or more generally latent variables, makes interpretation of results computed with MCMC ...
197
click to vote
COMPGEOM
2006
ACM
16 years 7 days ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
173
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
155
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
Decreasing diagrams technique (van Oostrom, 1994) is a technique that can be widely applied to prove confluence of rewrite systems. To directly apply the decreasing diagrams techn...
156
click to vote
ICRA
1998
IEEE
15 years 10 months ago
1998
IEEE
We describe a model-based object tracking system that updates the configuration parameters of an object model based upon information gathered from a sequence of monocular images. ...