3875 search results - page 405 / 775 » Approximation algorithms for the 0-extension problem |
181
click to vote
SPAA
2006
ACM
16 years 22 days 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...
172
click to vote
ICALP
2003
Springer
16 years 4 hour 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...
171
click to vote
KDD
2009
ACM
16 years 1 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...
185
click to vote
SIP
2003
15 years 8 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...
177
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
This paper studies the “explanation problem” for tree- and linearly-ordered array data, a problem motivated by database applications and recently solved for the one-dimensiona...