Sciweavers

1578 search results - page 44 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
INFOCOM
2007
IEEE
16 years 13 days ago
Low-Complexity and Distributed Energy Minimization in Multi-Hop Wireless Networks
— 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...
Longbi Lin, Xiaojun Lin, Ness B. Shroff
174
Voted
SPAA
2006
ACM
16 years 2 days ago
Semi-oblivious routing
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. ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, To...
163
Voted
ALGOSENSORS
2004
Springer
15 years 11 months ago
On the Computational Complexity of Sensor Network Localization
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...
James Aspnes, David Kiyoshi Goldenberg, Yang Richa...
SSD
2001
Springer
120views Database» more  SSD 2001»
15 years 10 months ago
On Multi-way Spatial Joins with Direction Predicates
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...
Hongjun Zhu, Jianwen Su, Oscar H. Ibarra
164
Voted
CMSB
2006
Springer
15 years 10 months ago
Randomization and Feedback Properties of Directed Graphs Inspired by Gene Networks
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...
M. Cosentino Lagomarsino, P. Jona, B. Bassetti