4137 search results - page 95 / 828 » On the number of matchings of a tree |
171
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
We study Pareto optimal matchings in the context of house allocation problems. We present an O( √ nm) algorithm, based on Gale’s Top Trading Cycles Method, for finding a maxim...
169
click to vote
ISAAC
2009
Springer
16 years 27 days ago
2009
Springer
Many database systems that use a B+ tree as the underlying data structure do not do rebalancing on deletion. This means that a bad sequence of deletions can create a very unbalance...
181
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
156
click to vote
DCC
2001
IEEE
16 years 6 months ago
2001
IEEE
This paper studies quantization error in the context of Matching Pursuit coded streams and proposes a new coefficient quantization scheme taking benefit of the Matching Pursuit pr...
174
click to vote
WAOA
2005
Springer
15 years 11 months ago
2005
Springer
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...