2262 search results - page 99 / 453 » Points with large quadrant-depth |
198
click to vote
MIAR
2006
IEEE
16 years 10 days ago
2006
IEEE
This paper presents a general learning framework for non-rigid registration of MR brain images. Given a set of training MR brain images, three major types of information are partic...
168
click to vote
DAGM
2004
Springer
15 years 11 months ago
2004
Springer
We consider the general problem of learning from labeled and unlabeled data. Given a set of points, some of them are labeled, and the remaining points are unlabeled. The goal is to...
142
click to vote
ICDM
2003
IEEE
15 years 11 months ago
2003
IEEE
We propose a novel clustering algorithm that is similar in spirit to classification trees. The data is recursively split using a criterion that applies a discrete curve evolution...
133
click to vote
KBSE
2003
IEEE
15 years 11 months ago
2003
IEEE
Automating software evolution requires both identifying precisely the affected program points and selecting the appropriate modification at each point. This task is particularly ...
172
click to vote
DAC
1989
ACM
15 years 10 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...