Sciweavers

87 search results - page 7 / 18
» Solving large Steiner Triple Covering Problems
Sort
View
COMCOM
2006
168views more  COMCOM 2006»
13 years 7 months ago
Relay node placement in large scale wireless sensor networks
Scalability and extended lifetime are two critical design goals of any large scale wireless sensor network. A two-tiered network model has been proposed recently for this purpose....
Jian Tang, Bin Hao, Arunabha Sen
COLT
2003
Springer
14 years 26 days ago
On Finding Large Conjunctive Clusters
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
Nina Mishra, Dana Ron, Ram Swaminathan
LION
2009
Springer
145views Optimization» more  LION 2009»
14 years 2 months ago
A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...
Rong Qu, Ying Xu, Graham Kendall
SEMWEB
2010
Springer
13 years 5 months ago
Finding the Achilles Heel of the Web of Data: Using Network Analysis for Link-Recommendation
Abstract. The Web of Data is increasingly becoming an important infrastructure for such diverse sectors as entertainment, government, ecommerce and science. As a result, the robust...
Christophe Guéret, Paul T. Groth, Frank van...
FOCM
2010
97views more  FOCM 2010»
13 years 6 months ago
Self-Concordant Barriers for Convex Approximations of Structured Convex Sets
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
Levent Tunçel, Arkadi Nemirovski