Sciweavers

14084 search results - page 2436 / 2817
» A Theory for Game Theories
Sort
View
CORR
2011
Springer
202views Education» more  CORR 2011»
15 years 1 months ago
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
CORR
2011
Springer
151views Education» more  CORR 2011»
15 years 1 months ago
Generating and Searching Families of FFT Algorithms
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...
Steve Haynal, Heidi Haynal
SIAMSC
2011
148views more  SIAMSC 2011»
15 years 1 months ago
Bootstrap AMG
We develop an algebraic multigrid (AMG) setup scheme based on the bootstrap framework for multiscale scientific computation. Our approach uses a weighted least squares definition...
Achi Brandt, James J. Brannick, K. Kahl, Irene Liv...
TSP
2011
96views more  TSP 2011»
15 years 1 months ago
A Signal Processing Approach to Fourier Analysis of Ranking Data: The Importance of Phase
—Ranking data is a type of data obtained in some elections, in customer surveys, as well as from web search results. Such data may be considered as a type of signal defined on t...
Ramakrishna Kakarala
CORR
2011
Springer
165views Education» more  CORR 2011»
14 years 10 months ago
Tight Upper Bounds for Streett and Parity Complementation
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
Yang Cai, Ting Zhang
« Prev « First page 2436 / 2817 Last » Next »