Sciweavers

356 search results - page 40 / 72
» Submodular Approximation: Sampling-based Algorithms and Lowe...
Sort
View
INFOCOM
2002
IEEE
14 years 23 days ago
Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
Peng-Jun Wan, Khaled M. Alzoubi, Ophir Frieder
GLOBECOM
2007
IEEE
14 years 2 months ago
Capacity and Fairness of MIMO Broadcast Algorithms in Shadow Fading Environments
Abstract— For MIMO broadcast systems the effects of shadowing on the channel capacity and the fairness of the system in sharing the resources amongst multiple users are important...
Timothy W. King, Peter J. Smith, Lee M. Garth
LATIN
2010
Springer
13 years 9 months ago
Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
Eric Angel, Evripidis Bampis, Nicolas Thibault
HEURISTICS
2006
197views more  HEURISTICS 2006»
13 years 7 months ago
Bucket elimination for multiobjective optimization problems
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
Emma Rollon, Javier Larrosa
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
14 years 8 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li