Sciweavers

3007 search results - page 539 / 602
» Linear Functional Fixed-points
Sort
View
JGO
2010
100views more  JGO 2010»
14 years 4 months ago
On convex relaxations of quadrilinear terms
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
Sonia Cafieri, Jon Lee, Leo Liberti
PVLDB
2010
252views more  PVLDB 2010»
14 years 4 months ago
Efficient and Effective Similarity Search over Probabilistic Data based on Earth Mover's Distance
Probabilistic data is coming as a new deluge along with the technical advances on geographical tracking, multimedia processing, sensor network and RFID. While similarity search is...
Jia Xu, Zhenjie Zhang, Anthony K. H. Tung, Ge Yu
TASLP
2010
97views more  TASLP 2010»
14 years 4 months ago
Voice Conversion Using Partial Least Squares Regression
Abstract--Voice conversion can be formulated as finding a mapping function which transforms the features of the source speaker to those of the target speaker. Gaussian mixture mode...
Elina Helander, Tuomas Virtanen, Jani Nurminen, Mo...
TSP
2010
14 years 4 months ago
Quasi-interpolation by means of filter-banks
We consider the problem of approximating a regular function f(t) from its samples, f(nT), taken in a uniform grid. Quasi-interpolation schemes approximate f(t) with a dilated versi...
Gerardo Pérez-Villalón
CORR
2011
Springer
168views Education» more  CORR 2011»
14 years 4 months ago
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
Abhimanyu Das, David Kempe