822 search results - page 9 / 165 » Descendants in Increasing Trees |
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 ...
ICDE
2003
IEEE
14 years 9 months ago
2003
IEEE
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
ICW
2005
IEEE
14 years 1 months ago
2005
IEEE
Most sensor network applications require quality of service guarantees on a network-wide basis, suggesting the need for global network cost optimization. The dynamic and nonunifor...
ICDT
2010
ACM
13 years 9 months ago
2010
ACM
When a query is evaluated under bag semantics, each answer is returned as many times as it has derivations. Bag semantics has long been recognized as important, especially when ag...