17760 search results - page 198 / 3552 » A Generalization of the Massey-Ding Algorithm |
163
click to vote
CCCG
2009
15 years 5 months ago
2009
Clarkson's algorithm is a two-staged randomized algorithm for solving linear programs, but it can also be applied to the more general LP-type problems which comprise a number...
137
click to vote
JSAC
2010
14 years 11 months ago
2010
Abstract--In this paper, we formulate a flow control optimization problem for wireless sensor networks with lifetime constraint and link interference in an asynchronous setting. Ou...
257
click to vote
WADS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper we consider the geometric version of the problem, where all ...
115
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central prob...
150
click to vote
PARA
2004
Springer
15 years 9 months ago
2004
Springer
It is known that in general, statistical analysis of interval data is an NP-hard problem: even computing the variance of interval data is, in general, NP-hard. Until now, only one ...