1578 search results - page 44 / 316 » Direct Routing: Algorithms and Complexity |
149
click to vote
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— In this work, we study the problem of minimizing the total power consumption in a multi-hop wireless network subject to a given offered load. It is well-known that the total po...
140
Voted
SPAA
2006
ACM
15 years 8 months ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
128
Voted
ALGOSENSORS
2004
Springer
15 years 8 months ago
2004
Springer
Determining the positions of the sensor nodes in a network is essential to many network functionalities such as routing, coverage and tracking, and event detection. The localizatio...
137
Voted
SSD
2001
Springer
15 years 7 months ago
2001
Springer
Spatial joins are fundamental in spatial databases. Over the last decade, the primary focus of research has been on joins with the predicate “region intersection.” In modern da...
112
Voted
CMSB
2006
Springer
15 years 6 months ago
2006
Springer
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...