Sciweavers

1301 search results - page 21 / 261
» Bounded Version Vectors
Sort
View
FOCM
2010
140views more  FOCM 2010»
15 years 2 months ago
Combinatorial Sublinear-Time Fourier Algorithms
We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how t...
Mark A. Iwen
ICASSP
2011
IEEE
14 years 7 months ago
Robust adaptive beamforming based on jointly estimating covariance matrix and steering vector
In this paper, a new adaptive beamforming algorithm with joint robustness against covariance matrix uncertainty as well as steering vector mismatch is proposed. First, the theoret...
Yujie Gu, Amir Leshem
CORR
2006
Springer
138views Education» more  CORR 2006»
15 years 4 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
DAM
2008
108views more  DAM 2008»
15 years 4 months ago
On the complexity of the multicut problem in bounded tree-width graphs and digraphs
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
Cédric Bentz
JASSS
2002
85views more  JASSS 2002»
15 years 3 months ago
Opinion dynamics and bounded confidence: models, analysis and simulation
When does opinion formation within an interacting group lead to consensus, polarization or fragmentation? The article investigates various models for the dynamics of continuous opi...
Rainer Hegselmann, Ulrich Krause