Sciweavers

654 search results - page 13 / 131
» An efficient approximation algorithm for the survivable netw...
Sort
View
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 7 months ago
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 8 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
14 years 7 months ago
Provisioning a virtual private network: a network design problem for multicommodity flow
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev...
AINA
2005
IEEE
14 years 1 months ago
Optimal Energy-Efficient Routing for Wireless Sensor Networks
The network lifetime for wireless sensor network plays an important role to survivability. Thus, we indicate the importance of routing protocol to network lifetime, and model the ...
Chih-Wei Shiou, Frank Yeong-Sung Lin, Hsu-Chen Che...
CORR
2010
Springer
437views Education» more  CORR 2010»
13 years 5 months ago
A Distributed Cluster Scheme For Bandwidth Management In Multi-hop MANETs
Electronic collaboration among devices in a geographically localized environment is made possible with the implementation of IEEE 802.11 based wireless ad hoc networks. Dynamic na...
Binod Kumar Pattanayak, Alok Kumar Jagadev, Manoj ...