2714 search results - page 353 / 543 » Approximation Schemes for Scheduling |
173
click to vote
TELETRAFFIC
2007
Springer
16 years 19 days ago
2007
Springer
We study the capacity allocation problem in service overlay networks (SON)s with state-dependent connection routing based on revenue maximization. We formulate the dimensioning pro...
171
click to vote
ICMCS
2006
IEEE
16 years 17 days ago
2006
IEEE
Multi-reference frame motion estimation improves the accuracy of motion compensation in video compression, but it also dramatically increases computational complexity. Based on tr...
199
click to vote
WIRN
2005
Springer
15 years 12 months ago
2005
Springer
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
184
click to vote
WAOA
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
134
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We show that linear probing requires 5-independent hash functions for expected constant-time performance, matching an upper bound of [Pagh et al. STOC’07]. For (1 + ε)-approxima...