1279 search results - page 67 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
148
click to vote
ECRTS
2004
IEEE
15 years 8 months ago
2004
IEEE
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
139
click to vote
TIT
2010
14 years 11 months ago
2010
We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave ut...
140
click to vote
SIGECOM
2005
ACM
15 years 10 months ago
2005
ACM
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...
136
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
149
Voted
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...