Sciweavers

CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 10 months ago
Learning Functions of Few Arbitrary Linear Parameters in High Dimensions
Let us assume that f is a continuous function defined on the unit ball of Rd , of the form f(x) = g(Ax), where A is a k×d matrix and g is a function of k variables for k ≪ d. ...
Massimo Fornasier, Karin Schnass, Jan Vybír...
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 10 months ago
The LASSO risk for gaussian matrices
We consider the problem of learning a coefficient vector x0 ∈ RN from noisy linear observation y = Ax0 + w ∈ Rn . In many contexts (ranging from model selection to image proce...
Mohsen Bayati, Andrea Montanari
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 10 months ago
Viewpoints: A high-performance high-dimensional exploratory data analysis tool
Scientific data sets continue to increase in both size and complexity. In the past, dedicated graphics systems at supercomputing centers were required to visualize large data sets,...
Paul R. Gazis, C. Levit, Michael J. Way
CORR
2010
Springer
183views Education» more  CORR 2010»
13 years 10 months ago
Discovering shared and individual latent structure in multiple time series
This paper proposes a nonparametric Bayesian method for exploratory data analysis and feature construction in continuous time series. Our method focuses on understanding shared fe...
Suchi Saria, Daphne Koller, Anna Penn
CORR
2010
Springer
131views Education» more  CORR 2010»
13 years 10 months ago
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
Henry Cohn, Nadia Heninger
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 10 months ago
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
Nikhil Bansal, Anupam Gupta, Jian Li, Juliá...
CORR
2010
Springer
133views Education» more  CORR 2010»
13 years 10 months ago
Reformulation of Global Constraints in Answer Set Programming
We show that global constraints on finite domains like alldifferent can be reformulated into answer set programs on which we achieve arc, bound or range consistency. These reform...
Christian Drescher, Toby Walsh
CORR
2010
Springer
53views Education» more  CORR 2010»
13 years 10 months ago
Multi-Agent Deployment for Visibility Coverage in Polygonal Environments with Holes
Karl J. Obermeyer, Anurag Ganguli, Francesco Bullo
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 10 months ago
Structural Solutions to Dynamic Scheduling for Multimedia Transmission in Unknown Wireless Environments
In this paper, we propose a systematic solution to the problem of scheduling delay-sensitive media data for transmission over time-varying wireless channels. We first formulate th...
Fangwen Fu, Mihaela van der Schaar
CORR
2010
Springer
66views Education» more  CORR 2010»
13 years 10 months ago
Three-Level Parallel J-Jacobi Algorithms for Hermitian Matrices
The paper describes several efficient parallel implementations of the one-sided hyperbolic Jacobi-type algorithm for computing eigenvalues and eigenvectors of Hermitian matrices. ...
Sanja Singer, Sasa Singer, Vedran Novakovic, Davor...