Sciweavers

42 search results - page 1 / 9
» The Number of Tree Stars Is O *(1.357 k )
Sort
View
ALGORITHMICA
2007
57views more  ALGORITHMICA 2007»
13 years 4 months ago
The Number of Tree Stars Is O *(1.357 k )
Bernhard Fuchs, Walter Kern, Xinhui Wang
AHSWN
2008
92views more  AHSWN 2008»
13 years 4 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
MICS
2010
134views more  MICS 2010»
13 years 3 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
SSD
2001
Springer
120views Database» more  SSD 2001»
13 years 9 months ago
On Multi-way Spatial Joins with Direction Predicates
Spatial joins are fundamental in spatial databases. Over the last decade, the primary focus of research has been on joins with the predicate “region intersection.” In modern da...
Hongjun Zhu, Jianwen Su, Oscar H. Ibarra
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 4 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah