Sciweavers

662 search results - page 10 / 133
» Classified Stable Matching
Sort
View
CCR
2006
122views more  CCR 2006»
14 years 9 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
COCOON
2003
Springer
15 years 2 months ago
Randomized Approximation of the Stable Marriage Problem
Abstract. While the original stable marriage problem requires all participants to rank all members of the opposite sex in a strict order, two natural variations are to allow for in...
Magnús M. Halldórsson, Kazuo Iwama, ...
ICDCS
2007
IEEE
15 years 1 months ago
Stratification in P2P Networks: Application to BitTorrent
We consider a model for decentralized collaborative networks that is based on stable matching theory. This model is applied to systems with a global ranking utility function, whic...
Anh-Tuan Gai, Fabien Mathieu, Fabien de Montgolfie...
ECCV
2004
Springer
15 years 11 months ago
Detecting Keypoints with Stable Position, Orientation, and Scale under Illumination Changes
Local feature approaches to vision geometry and object recognition are based on selecting and matching sparse sets of visually salient image points, known as `keypoints' or `p...
Bill Triggs
AAIM
2006
Springer
97views Algorithms» more  AAIM 2006»
15 years 3 months ago
Note on an Auction Procedure for a Matching Game in Polynomial Time
Abstract. We derive a polynomial time algorithm to compute a stable solution in a mixed matching market from an auction procedure as presented by Eriksson and Karlander [5]. As a s...
Winfried Hochstättler, Hui Jin 0002, Robert N...