Sciweavers

1405 search results - page 130 / 281
» Popularity at Minimum Cost
Sort
View
JCST
2008
203views more  JCST 2008»
15 years 4 months ago
Scoped Bellman-Ford Geographic Routing for Large Dynamic Wireless Sensor Networks
Routing is a fundamental problem in wireless sensor networks. Most previous routing protocols are challenged when used in large dynamic networks as they suffer from either poor sca...
Xue Zhang, Jue Hong, Sanglu Lu, Li Xie, Jiannong C...
JCO
2006
150views more  JCO 2006»
15 years 4 months ago
Efficient algorithms for shared backup allocation in networks with partial information
Abstract. We study efficient algorithms for establishing reliable connections with bandwidth guarantees in communication networks. In the normal mode of operation, each connection ...
Yigal Bejerano, Joseph Naor, Alexander Sprintson
PAMI
2006
164views more  PAMI 2006»
15 years 4 months ago
A Binary Linear Programming Formulation of the Graph Edit Distance
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
Derek Justice, Alfred O. Hero
TSP
2008
106views more  TSP 2008»
15 years 4 months ago
Guaranteeing Practical Convergence in Algorithms for Sensor and Source Localization
This paper considers localization of a source or a sensor from distance measurements. We argue that linear algorithms proposed for this purpose are susceptible to poor noise perfor...
Baris Fidan, Soura Dasgupta, Brian D. O. Anderson
TWC
2008
120views more  TWC 2008»
15 years 4 months ago
Energy minimization of a QAM system with fading
In this paper, the problem of choosing constellation size and transmit power that minimizes the energy-per-goodbit in a frequency-flat, long-term static fading channel is considere...
Raghavendra S. Prabhu, Babak Daneshrad