38 search results - page 5 / 8 » A General Lower Bound on the I O-Complexity of Comparison-ba... |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
QEST
2008
IEEE
14 years 2 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...