74 search results - page 6 / 15 » Weighted height of random trees |
ICPR
2000
IEEE
14 years 8 months ago
2000
IEEE
We consider di usion processes on a class of R trees. The processes are de ned in a manner similar to that of Le Gall's Brownian snake. Each point in the tree has a real value...
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...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such appl...
VTC
2007
IEEE
14 years 1 months ago
2007
IEEE
— This paper investigates the topology formation mechanisms provided by IEEE 802.15.4 to create tree-based topologies, in the context of a multi-sink wireless sensor network. The...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...