Sciweavers

1986 search results - page 36 / 398
» Path Separability of Graphs
Sort
View
ICASSP
2011
IEEE
13 years 12 days ago
Promoting convergence in multi-channel blind signal separation using PNLMS
The proportionate normalized least-mean squares (PNLMS) adaptation algorithm exploits the sparse nature of acoustic impulse responses and assigns adaptation gain proportional to t...
Muhammad Z. Ikram
SIAMCO
2000
74views more  SIAMCO 2000»
13 years 8 months ago
Nonsmooth Duality, Sandwich, and Squeeze Theorems
Given a nonlinear function h separating a convex and a concave function, we provide various conditions under which there exists an affine separating function whose graph is somewhe...
A. S. Lewis, R. E. Lucchetti
ICRA
2008
IEEE
133views Robotics» more  ICRA 2008»
14 years 3 months ago
Object separation using active methods and multi-view representations
— Daily life objects reveal natural similarities, which cannot be resolved with the perception of a single view. In this paper, we present an approach for object separation using...
Kai Welke, Tamim Asfour, Rüdiger Dillmann
CISS
2008
IEEE
14 years 3 months ago
Optimizing redundancy using MDS codes and dynamic symbol allocation in mobile ad hoc networks
—We consider the design of a network in which packet transmissions between two nodes are to be guaranteed a certain probability of success. There are N independent paths between ...
Anna Kacewicz, Stephen B. Wicker
CORR
2010
Springer
167views Education» more  CORR 2010»
13 years 6 months ago
Compressive Sensing over Graphs
In this paper, motivated by network inference and tomography applications, we study the problem of compressive sensing for sparse signal vectors over graphs. In particular, we are ...
Weiyu Xu, Enrique Mallada, Ao Tang