Sciweavers

95 search results - page 7 / 19
» Separating Quantum and Classical Learning
Sort
View
APIN
1999
114views more  APIN 1999»
13 years 9 months ago
Evolutionary Approaches to Figure-Ground Separation
The problem of figure-ground separation is tackled from the perspective of combinatorial optimization. Previous attempts have used deterministic optimization techniques based on re...
Suchendra M. Bhandarkar, Xia Zeng
CORR
2002
Springer
102views Education» more  CORR 2002»
13 years 9 months ago
Quantum Lower Bound for Recursive Fourier Sampling
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
Scott Aaronson
CORR
2006
Springer
97views Education» more  CORR 2006»
13 years 9 months ago
The one-way communication complexity of the Boolean Hidden Matching Problem
We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...
Iordanis Kerenidis, Ran Raz
NIPS
2004
13 years 11 months ago
Blind One-microphone Speech Separation: A Spectral Learning Approach
We present an algorithm to perform blind, one-microphone speech separation. Our algorithm separates mixtures of speech without modeling individual speakers. Instead, we formulate ...
Francis R. Bach, Michael I. Jordan
ALT
2007
Springer
14 years 6 months ago
Learning Kernel Perceptrons on Noisy Data Using Random Projections
In this paper, we address the issue of learning nonlinearly separable concepts with a kernel classifier in the situation where the data at hand are altered by a uniform classific...
Guillaume Stempfel, Liva Ralaivola