1214 search results - page 81 / 243 » Labeling Points with Weights |
158
click to vote
CLASSIFICATION
2006
15 years 6 months ago
2006
Abstract. Given a set of pairwise distances on a set of n points, constructing an edge-weighted tree whose leaves are these n points such that the tree distances would mimic the or...
152
click to vote
IMAMS
2007
15 years 7 months ago
2007
Abstract. In this work we focus on approximations of continuous harmonic functions by discrete harmonic functions based on the discrete Laplacian in a triangulation of a point set....
182
click to vote
IPMI
1993
Springer
15 years 10 months ago
1993
Springer
Thispaperdescribesatechniqueforbuildingcompactmodelsoftheshapeandappearance offlexibleobjects(suchasorgans)seenin2-Dimages. Themodelsarederivedfromthestatisticsof setsof labelled i...
152
click to vote
ICPR
2010
IEEE
15 years 6 months ago
2010
IEEE
—Evaluating the performance of a classification algorithm critically requires a measure of the degree to which unseen examples have been identified with their correct class lab...
160
click to vote
JMLR
2010
15 years 29 days ago
2010
After building a classifier with modern tools of machine learning we typically have a black box at hand that is able to predict well for unseen data. Thus, we get an answer to the...