1950 search results - page 6 / 390 » Varieties of Increasing Trees |
SPAA
1996
ACM
13 years 11 months ago
1996
ACM
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
COMBINATORICS
2002
13 years 7 months ago
2002
Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limit...
IANDC
2008
13 years 7 months ago
2008
We investigate code trees and search trees with cost functions that increase exponentially with the depth in the tree. While corresponding coding theorems have been considered in ...
HICSS
2008
IEEE
14 years 1 months ago
2008
IEEE
How does “self-governance” happen in Wikipedia? Through in-depth interviews with eleven individuals who have held a variety of responsibilities in the English Wikipedia, we ob...
ECOOP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In aspect-oriented programming, pointcuts are used to describe crossstructure. Pointcuts that abstract over irrelevant implementation details are clearly desired to bette...