Sciweavers

10608 search results - page 560 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
JMLR
2010
109views more  JMLR 2010»
15 years 1 months ago
Matrix Completion from Noisy Entries
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of app...
Raghunandan H. Keshavan, Andrea Montanari, Sewoong...
MST
2010
117views more  MST 2010»
15 years 1 months ago
The 1-Versus-2 Queries Problem Revisited
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...
Rahul Tripathi
ICASSP
2011
IEEE
14 years 10 months ago
Approximate nearest-subspace representations for sound mixtures
In this paper we present a novel approach to describe sound mixtures which is based on a geometric viewpoint. In this approach we extend the idea of a nearest-neighbor representat...
Paris Smaragdis
ICASSP
2011
IEEE
14 years 10 months ago
Class of double-talk detectors based on the holder inequality
Most of the echo cancellers are equipped with a double-talk detector (DTD) in order to control the behavior of the adaptive filter during double-talk situations. In this paper, w...
Constantin Paleologu, Jacob Benesty, Tomas Gä...
JMLR
2012
13 years 9 months ago
Graphlet decomposition of a weighted network
We introduce the graphlet decomposition of a weighted network, which encodes a notion of social information based on social structure. We develop a scalable algorithm, which combi...
Hossein Azari Soufiani, Edo Airoldi