44 search results - page 2 / 9 » On Optimal Node Splitting for R-trees |
INFOCOM
2002
IEEE
13 years 10 months ago
2002
IEEE
Abstract— In this paper, we address the problem of providing traffic quality of service and energy efficiency in ad hoc wireless networks. We consider a network that is shared ...
MOBICOM
2009
ACM
14 years 3 days ago
2009
ACM
The coexistence of two unlicensed links is considered, where one link interferes with the transmission of the other, over a timevarying, block-fading channel. In the absence of fa...
GLOBECOM
2008
IEEE
13 years 5 months ago
2008
IEEE
In many-to-many communication, a session consists of group of users (we call them members) where each one of the members transmits its traffic to all other members in the group. Th...
KDD
2007
ACM
14 years 6 months ago
2007
ACM
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
CLADE
2004
IEEE
13 years 9 months ago
2004
IEEE
Different schemes for large scale networks hosting distributed applications have been recently adopted for network path marking based on adaptive behavior of swarm-based agents. T...