Sciweavers

654 search results - page 27 / 131
» An efficient approximation algorithm for the survivable netw...
Sort
View
DAC
1998
ACM
14 years 9 months ago
Approximation and Decomposition of Binary Decision Diagrams
Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and mode...
Kavita Ravi, Kenneth L. McMillan, Thomas R. Shiple...
FOCS
2007
IEEE
14 years 3 months ago
Buy-at-Bulk Network Design with Protection
We consider approximation algorithms for buy-at-bulk network design, with the additional constraint that demand pairs be protected against edge or node failures in the network. In...
Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce...
AAAI
2006
13 years 10 months ago
Efficient L1 Regularized Logistic Regression
L1 regularized logistic regression is now a workhorse of machine learning: it is widely used for many classification problems, particularly ones with many features. L1 regularized...
Su-In Lee, Honglak Lee, Pieter Abbeel, Andrew Y. N...
IWCMC
2006
ACM
14 years 2 months ago
Energy efficient distributed connected dominating sets construction in wireless sensor networks
One important characteristic of wireless sensor networks is energy stringency. Constructing a connected dominating set (CDS) has been widely used as a topology control strategy to...
Yuanyuan Zeng, Xiaohua Jia, Yanxiang He
JCO
2006
153views more  JCO 2006»
13 years 8 months ago
Efficient point coverage in wireless sensor networks
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...
Jie Wang, Ning Zhong