Sciweavers

846 search results - page 46 / 170
» Dependent rounding and its applications to approximation alg...
Sort
View
IMCSIT
2010
13 years 5 months ago
Fast Construction of Broadcast Scheduling and Gossiping in Dynamic Ad Hoc Networks
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
Krzysztof Krzywdzinski
WADS
2009
Springer
274views Algorithms» more  WADS 2009»
14 years 2 months ago
Approximating Transitive Reductions for Directed Networks
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
INFOCOM
2009
IEEE
14 years 2 months ago
Power Controlled Scheduling with Consecutive Transmission Constraints: Complexity Analysis and Algorithm Design
Abstract—We study the joint power control and minimumframe-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transm...
Liqun Fu, Soung Chang Liew, Jianwei Huang
AINA
2007
IEEE
14 years 2 months ago
Data Stream Based Algorithms For Wireless Sensor Network Applications
Abstract— A wireless sensor network (WSN) is energy constrained, and the extension of its lifetime is one of the most important issues in its design. Usually, a WSN collects a la...
André L. L. de Aquino, Carlos Mauricio S. F...
COMPGEOM
2010
ACM
14 years 22 days ago
Approximating loops in a shortest homology basis from point data
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
Tamal K. Dey, Jian Sun, Yusu Wang