284 search results - page 2 / 57 » What Matchings Can Be Stable |
ICCV
1999
IEEE
13 years 11 months ago
1999
IEEE
This paper presents a first investigation on the structure from motion problem from the combination of full and weak perspective images. This problem arises in multiresolution obj...
TCS
2008
13 years 7 months ago
2008
The hospitals/residents (HR) problem is a many-to-one generalization of the stable marriage (SM) problem. Researchers have been interested in variants of stable matchings that eit...
CTRSA
2007
Springer
13 years 11 months ago
2007
Springer
At Financial Crypto 2006, Golle presented a novel framework for the privacy preserving computation of a stable matching (stable marriage). We show that the communication complexity...
ECAL
2001
Springer
13 years 12 months ago
2001
Springer
Cognitive mechanisms are shaped by evolution to match their environments. But through their use, these mechanisms exert a shaping force on their surroundings as well. Here we explo...
ISAAC
2003
Springer
14 years 16 days ago
2003
Springer
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...