563 search results - page 46 / 113 » Computing approximate PSD factorizations |
ISAAC
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
ESA
2009
Springer
14 years 4 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
FLAIRS
2004
13 years 11 months ago
2004
The issue of fire propagation in cities is of obvious importance to Civil Authorities, but does present issues of computational complexity. Our basic assumption is that some event...
CHI
1997
ACM
14 years 2 months ago
1997
ACM
Recent work in computer input control has sought to maximize the use of the fingers in the operation of computer pointing devices. The main rationale is the hypothesis that the m...