662 search results - page 11 / 133 » Classified Stable Matching |
IPL
2007
14 years 9 months ago
2007
Recently, a number of interesting algorithmic problems have arisen from the emergence, in a number of countries, of kidney exchange schemes, whereby live donors are matched with r...
86
Voted
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
We treat tracking as a matching problem of detected keypoints between successive frames. The novelty of this paper is to learn classifier-based keypoint descriptions allowing to i...
CATS
2008
14 years 11 months ago
2008
G is a well-covered graph provided all its maximal stable sets are of the same size (Plummer, 1970). S is a local maximum stable set of G, and we denote by S (G), if S is a maxim...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
This paper aims to provide insight into stability of collaboration choices in P2P networks. We study networks where exchanges between nodes are driven by the desire to receive the...
75
Voted
ICPR
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper the segmentation of a meeting into meeting events is investigated as well as the recognition of the detected segments. First the classification of a meeting event is...