2924 search results - page 18 / 585 » Lower Bounds in Distributed Computing |
FOCS
2002
IEEE
14 years 16 days ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
BMCBI
2006
13 years 7 months ago
2006
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
FIWAC
1993
13 years 11 months ago
1993
A new method for obtaining lower bounds for spherical t-designs is proposed. Applications and new bounds are given for t = 9, 10. Some restrictions on the distribution of the inne...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
We define and study the bandwidth determination problem in adhoc P2P environments. Using point-to-point bandwidth probes, the goal is to quickly determine each host's upload ...
COLT
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We derive upper and lower bounds for some statistical estimation problems. The upper bounds are established for the Gibbs algorithm. The lower bounds, applicable for all ...