Sciweavers

369 search results - page 50 / 74
» Approximation Algorithms for the Bi-criteria Weighted max-cu...
Sort
View
SIAMDM
2002
124views more  SIAMDM 2002»
14 years 11 months ago
Scheduling Unrelated Machines by Randomized Rounding
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
Andreas S. Schulz, Martin Skutella
PODC
2006
ACM
15 years 5 months ago
Local approximation schemes for topology control
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju
136
Voted
KDD
2012
ACM
207views Data Mining» more  KDD 2012»
13 years 2 months ago
Robust multi-task feature learning
Multi-task learning (MTL) aims to improve the performance of multiple related tasks by exploiting the intrinsic relationships among them. Recently, multi-task feature learning alg...
Pinghua Gong, Jieping Ye, Changshui Zhang
ATAL
2008
Springer
15 years 1 months ago
Approximating power indices
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
Yoram Bachrach, Evangelos Markakis, Ariel D. Proca...
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
15 years 6 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...