Learn More
We consider the fundamental problem of solving quadratic systems of equations in n variables, where yi = |〈ai,x〉|, i = 1, . . . ,m and x ∈ R is unknown. We propose a novel method, which starting with an initial guess computed by means of a spectral method, proceeds by minimizing a nonconvex functional as in the Wirtinger flow approach [11]. There are(More)
This paper explores the problem of spectral compressed sensing, which aims to recover a spectrally sparse signal from a small random subset of its n time domain samples. The signal of interest is assumed to be a superposition of r multidimensional complex sinusoids, while the underlying frequencies can assume any continuous values in the normalized(More)
We consider the problem of blind adaptive signal separation with an antenna array, based on the constant modulus (CM) criterion. An approximation to the CM cost function is proposed, which allows the use of the recursive least squares (RLS) optimization technique. A novel RLS constant modulus algorithm (RLS-CMA) is derived, where the modulus power of the(More)
The increasing availability of customer information is giving many Þrms the ability to reach and customize price and other marketing efforts to the tastes of the individual consumer. This ability is labeled as consumer addressability. Consumer addressability through sophisticated databases is particularly important for direct marketing Þrms, catalog(More)
Statistical inference and information processing of high-dimensional data often require an efficient and accurate estimation of their second-order statistics. With rapidly changing data, limited processing power and storage at the acquisition devices, it is desirable to extract the covariance structure from a single pass over the data and a small number of(More)
The product life cycle (PLC) is the result of multiple supply and demand forces. However, past research has focused primarily on the role of diffusion in driving the PLC. This study takes a step toward a broader theoretical perspective on the PLC by incorporating informational cascades and developing and testing many new hypotheses based on this theory. The(More)
A common algorithm to solve the shortest path problem (SPP) is the Dijkstra algorithm. In this paper, a generalized Dijkstra algorithm is proposed to handle SPP in an uncertain environment. Two key issues need to be addressed in SPP with fuzzy parameters. One is how to determine the addition of two edges. The other is how to compare the distance between two(More)
Active learning can lead to a dramatic reduction in labeling effort. However, in many practical implementations (such as crowdsourcing, surveys, high-throughput experimental design), it is preferable to query labels for batches of examples to be labelled in parallel. While several heuristics have been proposed for batch-mode active learning, little is known(More)