1068 search results - page 135 / 214 » Factorization as a Rank 1 Problem |
118
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: In a time-course microarray experiment, the expression level for each gene is observed across a number of time-points in order to characterize the temporal trajectorie...
135
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
112
click to vote
FOCS
1994
IEEE
15 years 7 months ago
1994
IEEE
This paper studies the problem of e ciently scheduling fully strict (i.e., wellstructured) multithreaded computations on parallel computers. A popular and practical method of sche...
148
click to vote
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
In this paper, we consider the problem of super-resolving a human face video by a very high (?16) zoom factor. Inspired by recent literature on hallucination and examplebased lear...
133
Voted
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...