Sciweavers

427 search results - page 32 / 86
» A Subexponential Bound for Linear Programming
Sort
View
CISS
2007
IEEE
14 years 2 months ago
Bounding A Statistical Measure Of Network Lifetime For Wireless Sensor Networks
—The inherent many-to-one flow of traffic in Wireless Sensor Networks produces a skewed distribution of energy consumption rates leading to the early demise of those sensors that...
Muhammad Usman Ilyas, Hayder Radha
SPAA
2009
ACM
14 years 10 days ago
Brief announcement: a lower bound for depth-restricted work stealing
Work stealing is a common technique used in the runtime schedulers of parallel languages such as Cilk and parallel libraries such as Intel Threading Building Blocks (TBB). Depth-r...
Jim Sukha
ICASSP
2009
IEEE
13 years 5 months ago
Robust joint localization and time synchronization in wireless sensor networks with bounded anchor uncertainties
A unified framework to jointly solve the two problems of localization and synchronization at the same time is presented in this paper. The joint approach is attractive because it ...
Jun Zheng, Yik-Chung Wu
JCO
2010
97views more  JCO 2010»
13 years 6 months ago
Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence
We study the extremal parameter N(n, m, H) which is the largest number of copies of a hypergraph H that can be formed of at most n vertices and m edges. Generalizing previous work...
Andrzej Dudek, Joanna Polcyn, Andrzej Rucinski
WCNC
2008
IEEE
14 years 2 months ago
Mitigation of the Propagation of Localization Error Using Multi-Hop Bounding
Abstract—In ad hoc position-location networks, location information is obtained through the sequential estimation of node locations. An unlocalized node can estimate its location...
R. Michael Buehrer, Swaroop Venkatesh, Tao Jia