Sciweavers

1578 search results - page 127 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
SIGCOMM
2010
ACM
13 years 9 months ago
Achieving O(1) IP lookup on GPU-based software routers
IP address lookup is a challenging problem due to the increasing routing table size, and higher line rate. This paper investigates a new way to build an efficient IP lookup scheme...
Jin Zhao, Xinya Zhang, Xin Wang, Xiangyang Xue
ADHOCNOW
2008
Springer
14 years 3 months ago
Request Satisfaction Problem in Synchronous Radio Networks
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
Benoît Darties, Sylvain Durand, Jér&o...
ICUMT
2009
13 years 6 months ago
SBCL - improved centroid estimation
Localization of sensor nodes is one of the key issues in Wireless Sensor Networks. It is a precondition for a variety of applications, as well as geographic clustering and routing....
Ralf Behnke, Jakob Salzmann, Dirk Timmermann
HIPC
2005
Springer
14 years 2 months ago
Sensor Selection Heuristic in Sensor Networks
We consider the problem of sensor selection so as to minimise error in estimated location of target. An algorithm based on selecting a sensor in a direction in which the error is ...
Vaishali P. Sadaphal, Bijendra N. Jain
ICIP
2007
IEEE
14 years 23 days ago
Space-Frequency Quantization using Directionlets
In our previous work [1], we proposed a construction of critically sampled perfect reconstruction transforms with directional vanishing moments (DVMs) imposed in the corresponding...
Vladan Velisavljevic, Baltasar Beferull-Lozano, Ma...