3192 search results - page 371 / 639 » The minimum latency problem |
139
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
152
click to vote
ECCV
2010
Springer
15 years 3 months ago
2010
Springer
Sturm-Triggs iteration is a standard method for solving the projective factorization problem. Like other iterative algorithms, this method suffers from some common drawbacks such ...
152
click to vote
IJAR
2010
15 years 2 months ago
2010
We consider the problem of learning Bayesian network models in a non-informative setting, where the only available information is a set of observational data, and no background kn...
163
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
133
click to vote
IOR
2010
15 years 2 months ago
2010
In many applications involving make-to-order or time-sensitive (e.g., perishable, seasonal) products, finished orders are often delivered to customers immediately or shortly after...