1941 search results - page 255 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
284
click to vote
SIGMOD
2006
ACM
16 years 7 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
213
click to vote
INFOCOM
2003
IEEE
16 years 8 days ago
2003
IEEE
Abstract— Emerging spread spectrum high-speed data networks utilize multiple channels via orthogonal codes or frequency-hopping patterns such that multiple users can transmit con...
188
click to vote
COMPGEOM
2006
ACM
16 years 29 days ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
192
click to vote
ANCS
2005
ACM
16 years 16 days ago
2005
ACM
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
166
Voted
ICDCN
2010
Springer
16 years 1 months ago
2010
Springer
Abstract— Motivated by the widespread proliferation of wireless networks employing directional antennas, we study the problem of provisioning bandwidth in such networks. Given a ...