2252 search results - page 140 / 451 » Lower Bounds for Dynamic Algorithms |
111
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
144
click to vote
CORR
2010
Springer
15 years 3 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...
127
click to vote
ATMOS
2008
15 years 5 months ago
2008
Abstract. In this paper we explore the possibility of applying the notions of Recoverable Robustness and Price of Recoverability (introduced by [5]) to railway rolling stock planni...
143
Voted
MOBICOM
2005
ACM
15 years 9 months ago
2005
ACM
Next generation fixed wireless broadband networks are being increasingly deployed as mesh networks in order to provide and extend access to the internet. These networks are chara...
123
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract—The main task in analyzing a switching network design (including circuit-, multirate-, and photonic-switching) is to determine the minimum number of some switching compo...