Sciweavers

1220 search results - page 146 / 244
» Minimal Interval Completions
Sort
View
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 9 months ago
Robust Matrix Decomposition with Outliers
Suppose a given observation matrix can be decomposed as the sum of a low-rank matrix and a sparse matrix (outliers), and the goal is to recover these individual components from th...
Daniel Hsu, Sham M. Kakade, Tong Zhang
CORR
2006
Springer
83views Education» more  CORR 2006»
13 years 9 months ago
How to Beat the Adaptive Multi-Armed Bandit
The multi-armed bandit is a concise model for the problem of iterated decision-making under uncertainty. In each round, a gambler must pull one of K arms of a slot machine, withou...
Varsha Dani, Thomas P. Hayes
DAM
2006
102views more  DAM 2006»
13 years 9 months ago
Secret sharing schemes on access structures with intersection number equal to one
The characterization of ideal access structures and the search for bounds on the optimal information rate are two important problems in secret sharing. These problems are studied ...
Jaume Martí-Farré, Carles Padr&oacut...
JCT
2006
73views more  JCT 2006»
13 years 9 months ago
Colouring lines in projective space
Let V be a vector space of dimension v over a field of order q. The q-Kneser graph has the kdimensional subspaces of V as its vertices, where two subspaces and are adjacent if and...
Ameera Chowdhury, Chris D. Godsil, Gordon F. Royle
TC
2008
13 years 9 months ago
Adaptive Fault Management of Parallel Applications for High-Performance Computing
As the scale of high-performance computing (HPC) continues to grow, failure resilience of parallel applications becomes crucial. In this paper, we present FT-Pro, an adaptive fault...
Zhiling Lan, Yawei Li