2252 search results - page 153 / 451 » Lower Bounds for Dynamic Algorithms |
137
Voted
GLOBECOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—The routing problem in Wireless Mesh Networks is concerned with finding “good” source-destination paths. It generally faces multiple objectives to be optimized, such as i) ...
129
Voted
INFOCOM
2005
IEEE
15 years 9 months ago
2005
IEEE
— We consider the problem of scheduling multiple users sharing a time-varying wireless channel. (As an example, this is a model of scheduling in 3G wireless technologies, such as...
144
Voted
DAWAK
2011
Springer
14 years 3 months ago
2011
Springer
(The original conference version of this paper mischaracterizes the contributions of the current authors, relative to the contributions of Keogh et al. [11, 12]. We would like to ...
119
Voted
LOCA
2009
Springer
15 years 10 months ago
2009
Springer
This paper presents two algorithms, non-linear regression and Kalman filtering, that fuse heterogeneous data (pseudorange and angle-of-arrival) from an ultra-wideband positioning ...
153
Voted
CRYPTO
2011
Springer
14 years 3 months ago
2011
Springer
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...