2924 search results - page 32 / 585 » Lower Bounds in Distributed Computing |
FOCS
2010
IEEE
13 years 6 months ago
2010
IEEE
We show that the minimum possible size of an -net for point objects and line (or rectangle)ranges in the plane is (slightly) bigger than linear in 1/ . This settles a problem rais...
IJCGA
2006
13 years 8 months ago
2006
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
NIPS
2004
13 years 10 months ago
2004
We develop a family of upper and lower bounds on the worst-case expected KL loss for estimating a discrete distribution on a finite number m of points, given N i.i.d. samples. Our...
RECOMB
2005
Springer
14 years 9 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
PODC
2006
ACM
14 years 2 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...