Sciweavers

4137 search results - page 40 / 828
» On the number of matchings of a tree
Sort
View
CORR
2010
Springer
86views Education» more  CORR 2010»
15 years 1 months ago
Matching with Couples Revisited
It is well known that a stable matching in a many-to-one matching market with couples need not exist. We introduce a new matching algorithm for such markets and show that for a ge...
Itai Ashlagi, Mark Braverman, Avinatan Hassidim
DAM
2007
103views more  DAM 2007»
15 years 1 months ago
The stable fixtures problem - A many-to-many extension of stable roommates
We study a many-to-many generalisation of the well-known stable roommates problem in which each participant seeks to be matched with a number of others. We present a linear-time a...
Robert W. Irving, Sandy Scott
FUN
2010
Springer
219views Algorithms» more  FUN 2010»
15 years 5 months ago
The Magic of a Number System
We introduce a new number system that supports increments with a constant number of digit changes. We also give a simple method that extends any number system supporting increments...
Amr Elmasry, Claus Jensen, Jyrki Katajainen
DATESO
2009
101views Database» more  DATESO 2009»
14 years 11 months ago
Using Top Trees For Easy Programming of Tree Algorithms
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
Michal Vajbar
130
Voted
AAAI
2007
15 years 4 months ago
Macroscopic Models of Clique Tree Growth for Bayesian Networks
In clique tree clustering, inference consists of propagation in a clique tree compiled from a Bayesian network. In this paper, we develop an analytical approach to characterizing ...
Ole J. Mengshoel