Sciweavers

63 search results - page 11 / 13
» Borovik-Poizat Rank and Stability
Sort
View
CP
2006
Springer
13 years 9 months ago
Distributed Stable Matching Problems with Ties and Incomplete Lists
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...
Ismel Brito, Pedro Meseguer
ESA
2007
Springer
143views Algorithms» more  ESA 2007»
14 years 1 months ago
Two's Company, Three's a Crowd: Stable Family and Threesome Roommates Problems
We investigate Knuth’s eleventh open question on stable matchings. In the stable family problem, sets of women, men, and dogs are given, all of whom state their preferences among...
Chien-Chung Huang
BMCBI
2010
106views more  BMCBI 2010»
13 years 7 months ago
Selection of optimal reference genes for normalization in quantitative RT-PCR
Background: Normalization in real-time qRT-PCR is necessary to compensate for experimental variation. A popular normalization strategy employs reference gene(s), which may introdu...
Inna Chervoneva, Yanyan Li, Stephanie Schulz, Sean...
ICIP
1998
IEEE
14 years 9 months ago
Invariant-based Data Model for Image Databases
We describe a new invariant-based data model for image databases under our approach for shape-based retrieval. The data model relies on contours description of the image shape, an...
Michael Kliot, Ehud Rivlin
ICALP
2009
Springer
14 years 2 months ago
Popular Mixed Matchings
We study the problem of matching applicants to jobs under one-sided preferences; that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly inv...
Telikepalli Kavitha, Julián Mestre, Meghana...