3894 search results - page 380 / 779 » Approximation Algorithms for Biclustering Problems |
138
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
150
click to vote
SPAA
2006
ACM
15 years 11 months ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
138
click to vote
ICALP
2003
Springer
15 years 10 months ago
2003
Springer
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...
151
click to vote
SIP
2003
15 years 6 months ago
2003
This paper presents an efficient method for designing full band IIR digital differentiators in the complex Chebyshev sense. The proposed method is based on the formulation of a g...
138
click to vote
KDD
2009
ACM
15 years 11 months ago
2009
ACM
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...