292 search results - page 11 / 59 » Are Stable Instances Easy |
114
Voted
ICALP
1999
Springer
15 years 5 months ago
1999
Springer
The original stable marriage problem requires all men and women to submit a complete and strictly ordered preference list. This is obviously often unrealistic in practice, and seve...
118
Voted
ISMAR
2003
IEEE
15 years 6 months ago
2003
IEEE
We present a fully automated approach to camera registration for Augmented Reality systems. It relies on purely passive vision techniques to solve the initialization and realtime ...
117
Voted
HOTI
2002
IEEE
15 years 5 months ago
2002
IEEE
High-performance input-queued switches require highspeed scheduling algorithms while maintaining good performance. Various round-robin scheduling algorithms for Virtual Output Que...
IPL
2007
15 years 18 days 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...
TON
2002
15 years 10 days ago
2002
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...