1068 search results - page 82 / 214 » Factorization as a Rank 1 Problem |
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
ICIP
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper, we address the problem of hallucinating a high resolution face given a low resolution input face. The problem is approached through sparse coding. To exploit the fa...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We prove that every n-point metric space of negative type (and, in particular, every npoint subset of L1) embeds into a Euclidean space with distortion O( log n ? log log n), a r...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...
SAC
2010
ACM
15 years 2 months ago
2010
ACM
We consider the problem of anomaly detection in multiple co-evolving data streams. In this paper, we introduce FRAHST (Fast Rank-Adaptive row-Householder Subspace Tracking). It au...