60 search results - page 2 / 12 » Lower bounds for designs in symmetric spaces |
SPAA
2004
ACM
13 years 11 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
FOCS
2008
IEEE
14 years 7 days ago
2008
IEEE
We show that for every n-point metric space M and positive integer k, there exists a spanning tree T with unweighted diameter O(k) and weight w(T) = O(k · n1/k ) · w(MST(M)), an...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We consider multiple description (MD) coding for the Gaussian source with K descriptions under the symmetric meansquared error (MSE) distortion constraints, and provide an approxim...
ISSS
2000
IEEE
13 years 10 months ago
2000
IEEE
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
EOR
2008
13 years 5 months ago
2008
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...