Sciweavers

2520 search results - page 1 / 504
» The complexity of approximating entropy
Sort
View
FUIN
2002
108views more  FUIN 2002»
15 years 1 months ago
Approximate Entropy Reducts
We use information entropy measure to extend the rough set based notion of a reduct. We introduce the Approximate Entropy Reduction Principle (AERP). It states that any simplificat...
Dominik Slezak
ECCC
2010
86views more  ECCC 2010»
15 years 2 months ago
On Approximating the Entropy of Polynomial Mappings
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...
Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P...
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
16 years 2 months ago
The complexity of approximating entropy
Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt R...
ICA
2004
Springer
15 years 7 months ago
Minimax Mutual Information Approach for ICA of Complex-Valued Linear Mixtures
Abstract. Recently, the authors developed the Minimax Mutual Information algorithm for linear ICA of real-valued mixtures, which is based on a density estimate stemming from Jaynes...
Jian-Wu Xu, Deniz Erdogmus, Yadunandana N. Rao, Jo...
IJIT
2004
15 years 3 months ago
Computing Entropy for Ortholog Detection
Abstract-- Biological sequences from different species are called orthologs if they evolved from a sequence of a common ancestor species and they have the same biological function....
Hsing-Kuo Pao, John Case