1429 search results - page 43 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
228
click to vote
MST
2010
15 years 2 months ago
2010
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
141
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
133
click to vote
JMM2
2007
15 years 4 months ago
2007
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
148
click to vote
PRL
2011
14 years 11 months ago
2011
Machine Learning based on the Regularized Least Square (RLS) model requires one to solve a system of linear equations. Direct-solution methods exhibit predictable complexity and s...
119
click to vote
IPL
2010
15 years 2 months ago
2010
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...