Sciweavers

88 search results - page 2 / 18
» On the optimal stacking of noisy observations
Sort
View
JMLR
2010
109views more  JMLR 2010»
13 years 28 days ago
Matrix Completion from Noisy Entries
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of app...
Raghunandan H. Keshavan, Andrea Montanari, Sewoong...
ACSAC
2005
IEEE
13 years 11 months ago
Evolving Successful Stack Overflow Attacks for Vulnerability Testing
The work presented in this paper is intended to test crucial system services against stack overflow vulnerabilities. The focus of the test is the user-accessible variables, that i...
Hilmi Günes Kayacik, A. Nur Zincir-Heywood, M...
ICML
1995
IEEE
14 years 7 months ago
Learning Policies for Partially Observable Environments: Scaling Up
Partially observable Markov decision processes (pomdp's) model decision problems in which an agent tries to maximize its reward in the face of limited and/or noisy sensor fee...
Michael L. Littman, Anthony R. Cassandra, Leslie P...
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 6 months ago
Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
Martin J. Wainwright
DATE
2007
IEEE
155views Hardware» more  DATE 2007»
14 years 14 days ago
A novel technique to use scratch-pad memory for stack management
Extensive work has been done for optimal management of scratch-pad memory (SPM) all assuming that the SPM is assigned a fixed address space. The main target objects to be placed o...
Soyoung Park, Hae-woo Park, Soonhoi Ha