Sciweavers

2681 search results - page 87 / 537
» Problem F
Sort
View
EOR
2006
57views more  EOR 2006»
13 years 10 months ago
Routing and wavelength assignment by partition colouring
The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, f...
Thiago F. Noronha, Celso C. Ribeiro
CORR
2010
Springer
100views Education» more  CORR 2010»
13 years 10 months ago
Fast-Group-Decodable STBCs via Codes over GF(4)
Abstract--In this paper we construct low ML decoding complexity STBCs by using the Pauli matrices as linear dispersion matrices. In this case the Hurwitz-Radon orthogonality condit...
Natarajan Lakshmi Prasad, B. Sundar Rajan
SODA
2008
ACM
82views Algorithms» more  SODA 2008»
13 years 11 months ago
A plant location guide for the unsure
This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...
Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Vi...
SIAMJO
2011
13 years 5 months ago
Minimizing the Condition Number of a Gram Matrix
Abstract. The condition number of a Gram matrix defined by a polynomial basis and a set of points is often used to measure the sensitivity of the least squares polynomial approxim...
Xiaojun Chen, Robert S. Womersley, Jane J. Ye
SIAMSC
2011
162views more  SIAMSC 2011»
13 years 5 months ago
Accelerating the LSTRS Algorithm
In a recent paper [Rojas, Santos, Sorensen: ACM ToMS 34 (2008), Article 11] an efficient method for solving the Large-Scale Trust-Region Subproblem was suggested which is based on ...
Jörg Lampe, Marielba Rojas, Danny C. Sorensen...