Sciweavers

934 search results - page 55 / 187
» Quantum Algorithmic Entropy
Sort
View
ICALP
2003
Springer
14 years 2 months ago
A Direct Sum Theorem in Communication Complexity via Message Compression
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
GRC
2008
IEEE
13 years 10 months ago
Fuzzy Entropy based Max-Relevancy and Min-Redundancy Feature Selection
Feature selection is an important problem for pattern classification systems. Mutual information is a good indicator of relevance between variables, and has been used as a measure...
Shuang An, Qinghua Hu, Daren Yu
ICML
2010
IEEE
13 years 9 months ago
Nonparametric Information Theoretic Clustering Algorithm
In this paper we propose a novel clustering algorithm based on maximizing the mutual information between data points and clusters. Unlike previous methods, we neither assume the d...
Lev Faivishevsky, Jacob Goldberger
STOC
2003
ACM
64views Algorithms» more  STOC 2003»
14 years 9 months ago
Hidden translation and orbit coset in quantum computing
Katalin Friedl, Gábor Ivanyos, Fréd&...