3993 search results - page 594 / 799 » Matchmaking for Structured Objects |
156
Voted
CVPR
2006
IEEE
16 years 5 months ago
2006
IEEE
We consider the general problem of learning from both labeled and unlabeled data. Given a set of data points, only a few of them are labeled, and the remaining points are unlabele...
137
Voted
MICCAI
2003
Springer
16 years 4 months ago
2003
Springer
This paper describes shape analysis of the caudate nucleus structure in a large schizophrenia study (30 controls, 60 schizophrenics). Although analysis of the caudate has not drawn...
128
Voted
KDD
2007
ACM
16 years 4 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
156
Voted
IWCIA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
139
click to vote
KBSE
2007
IEEE
15 years 10 months ago
2007
IEEE
Achieving high structural coverage such as branch coverage in objectoriented programs is an important and yet challenging goal due to two main challenges. First, some branches inv...