2520 search results - page 27 / 504 » The complexity of approximating entropy |
FSKD
2008
Springer
13 years 10 months ago
2008
Springer
Evaluating web services provisioning is able to reduce redundancy in search and also generates advantages to service providers who deliver valuable services. However, there exist ...
COLT
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. We consider the problem of estimating an unknown probability distribution from samples using the principle of maximum entropy (maxent). To alleviate overfitting with a v...
NIPS
2008
13 years 11 months ago
2008
Learning graphical models with hidden variables can offer semantic insights to complex data and lead to salient structured predictors without relying on expensive, sometime unatta...
NETWORKING
2004
13 years 11 months ago
2004
In this paper we propose a new packet classification algorithm, which can substantially improve the performance of a classifier by decreasing the rulebase lookup latency. The algor...
AAAI
2010
13 years 6 months ago
2010
Some real-world problems are partially decomposable, in that they can be decomposed into a set of coupled subproblems, that are each relatively easy to solve. However, when these ...