Sciweavers

1115 search results - page 15 / 223
» Separating Shape Graphs
Sort
View
TSP
2010
13 years 2 months ago
A dual perspective on separable semidefinite programming with applications to optimal downlink beamforming
This paper considers the downlink beamforming optimization problem that minimizes the total transmission power subject to global shaping constraints and individual shaping constrai...
Yongwei Huang, Daniel Pérez Palomar
ESANN
2006
13 years 8 months ago
A simple idea to separate convolutive mixtures in an undetermined scenario
We consider a blind separation problem for undetermined mixtures of two BPSK signals in a multi-path fading channel. We use independence and frequency diversity of the two source s...
Maciej Pedzisz, Ali Mansour
TSP
2008
72views more  TSP 2008»
13 years 7 months ago
Seismic Velocity and Polarization Estimation for Wavefield Separation
Abstract--We address the problem of estimating the shape parameters of seismic wavefields using linear arrays of three-component (3C) vector sensors with uncertain acquisition geom...
Daniela Donno, Arye Nehorai, Umberto Spagnolini
ICIP
2010
IEEE
13 years 5 months ago
3D vertebrae segmentation using graph cuts with shape prior constraints
Osteoporosis is a bone disease characterized by a reduction in bone mass, resulting in an increased risk of fractures. To diagnose the osteoporosis accurately, bone mineral densit...
Melih S. Aslan, Asem M. Ali, Dongqing Chen, Ben Ar...
WADS
1993
Springer
110views Algorithms» more  WADS 1993»
13 years 11 months ago
A Dynamic Separator Algorithm
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere ...
Deganit Armon, John H. Reif