2957 search results - page 336 / 592 » The Complexity of Polynomial-Time Approximation |
158
click to vote
TOG
2002
15 years 6 months ago
2002
Several techniques have been developed to approximate Bidirectional Reflectance Distribution Functions (BRDF) with acceptable quality and performance for realtime applications. Th...
189
click to vote
PKDD
2010
Springer
15 years 5 months ago
2010
Springer
In this paper we propose a Bayesian model for multi-task feature selection. This model is based on a generalized spike and slab sparse prior distribution that enforces the selectio...
187
Voted
SPIRE
2010
Springer
15 years 5 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
200
click to vote
JMLR
2010
15 years 1 months ago
2010
We propose a class of Bayesian networks appropriate for structured prediction problems where the Bayesian network's model structure is a function of the predicted output stru...
162
click to vote
PE
2010
Springer
15 years 1 months ago
2010
Springer
Current computer systems and communication networks tend to be highly complex, and they typically hide their internal structure from their users. Thus, for selected aspects of cap...