373 search results - page 4 / 75 » Counting in Trees for Free |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We propose an univesal scheme to design loop-free and superstabilizing protocols for constructing spanning trees optimizing any tree metrics (not only those that are isom...
EJC
2010
13 years 8 months ago
2010
Say a digraph is k-free if it has no directed cycles of length at most k, for k Z+ . Thomass
SODA
2010
ACM
14 years 6 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
ICDM
2003
IEEE
14 years 1 months ago
2003
IEEE
Tree structures are used extensively in domains such as computational biology, pattern recognition, computer networks, and so on. In this paper, we present an indexing technique f...
ICGI
2000
Springer
14 years 4 days ago
2000
Springer
A subpansive tree is a rooted tree that gives a partial order of nonterminal symbols of a context-free grammar. We formalize subpansive trees as background knowledge of CFGs, and i...