Sciweavers

13603 search results - page 400 / 2721
» On the Complexity of Computing Treelength
Sort
View
MST
2010
117views more  MST 2010»
15 years 2 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 11 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 11 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ä...
ICANN
2011
Springer
14 years 11 months ago
Extending Tree Kernels with Topological Information
The definition of appropriate kernel functions is crucial for the performance of a kernel method. In many of the state-of-the-art kernels for trees, matching substructures are con...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
JMLR
2012
13 years 10 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