104 search results - page 6 / 21 » Limit distribution of degrees in random family trees |
FSTTCS
2007
Springer
14 years 1 months ago
2007
Springer
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b 2. The aim is to nd a minimum weight spannin...
AINA
2006
IEEE
13 years 9 months ago
2006
IEEE
In this paper, we study the problem of data gathering in multi-hop wireless sensor networks. To tackle the high degree of channel contention and high probability of packet collisi...
ICDCS
2010
IEEE
13 years 11 months ago
2010
IEEE
—Two of the fundamental problems in peer-to-peer (P2P) streaming are as follows: what is the maximum streaming rate that can be sustained for all receivers, and what peering algo...
VMV
2008
13 years 8 months ago
2008
Machine learning with few training examples always leads to over-fitting problems, whereas human individuals are often able to recognize difficult object categories from only one ...
SODA
2012
ACM
11 years 9 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...