2520 search results - page 19 / 504 » The complexity of approximating entropy |
ICML
2003
IEEE
14 years 10 months ago
2003
IEEE
When the goal is to achieve the best correct classification rate, cross entropy and mean squared error are typical cost functions used to optimize classifier performance. However,...
CVPR
2011
IEEE
13 years 1 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
ISW
1997
Springer
14 years 1 months ago
1997
Springer
We introduce the notion of key stretching, a mechanism to convert short s-bit keys into longer keys, such that the complexity required to brute-force search a s + t-bit keyspace is...
IPMI
2007
Springer
14 years 10 months ago
2007
Springer
This paper presents a new method for constructing compact statistical point-based models of ensembles of similar shapes that does not rely on any specific surface parameterization....
IJAR
2008
13 years 9 months ago
2008
This paper reviews probabilistic approaches to rough sets in granulation, approximation, and rule induction. The Shannon entropy function is used to quantitatively characterize pa...