4137 search results - page 214 / 828 » On the number of matchings of a tree |
182
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We introduce a new technique to bound the asymptotic performance of splay trees. The basic idea is to transcribe, in an indirect fashion, the rotations performed by the splay tree...
166
click to vote
COMSIS
2006
15 years 6 months ago
2006
In this paper we present an improvement of the precision of classification algorithm results. Two various approaches are known: bagging and boosting. This paper describes a set of ...
207
click to vote
TCS
2008
15 years 6 months ago
2008
In this paper, we consider two facility location problems on tree networks. One is the 2-radius problem, whose goal is to partition the vertex set of the given network into two no...
149
click to vote
ORDER
2002
15 years 6 months ago
2002
: In this paper we examine the interactions between the topology of certain linearly ordered topological spaces (LOTS) and the properties of trees in whose branch spaces they embed...
221
click to vote
PODC
2004
ACM
16 years 1 days ago
2004
ACM
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...