2957 search results - page 349 / 592 » The Complexity of Polynomial-Time Approximation |
198
click to vote
ESA
2000
Springer
15 years 10 months ago
2000
Springer
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
165
click to vote
ICAD
2004
15 years 8 months ago
2004
The human ability to recognize, identify and compare sounds based on their approximation of particular vowels provides an intuitive, easily learned representation for complex data...
169
click to vote
DICTA
2003
15 years 8 months ago
2003
In this paper we review a number of approaches to reducing, or removing, the problem of shift variance in the discrete wavelet transform (DWT). We describe a generalization of the ...
178
click to vote
WSC
2004
15 years 8 months ago
2004
Credit risk analysis for portfolios containing CDO tranches is a challenging task for risk managers. We propose here a basis function approach for CDO tranche valuation and portfo...
188
click to vote
UAI
1996
15 years 7 months ago
1996
Inference algorithms for arbitrary belief networks are impractical for large, complex belief networks. Inference algorithms for specialized classes of belief networks have been sh...