Sciweavers

1068 search results - page 18 / 214
» Factorization as a Rank 1 Problem
Sort
View
CVPR
2005
IEEE
15 years 11 months ago
Optimal Point Correspondence through the Use of Rank Constraints
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
João Costeira, João Xavier, Ricardo ...
BMCBI
2010
149views more  BMCBI 2010»
14 years 9 months ago
Identifying common prognostic factors in genomic cancer studies: A novel index for censored outcomes
Background: With the growing number of public repositories for high-throughput genomic data, it is of great interest to combine the results produced by independent research groups...
Sigrid Rouam, Thierry Moreau, Philippe Broët
FAST
2007
14 years 11 months ago
Disk Failures in the Real World: What Does an MTTF of 1, 000, 000 Hours Mean to You?
Component failure in large-scale IT installations is becoming an ever larger problem as the number of components in a single cluster approaches a million. In this paper, we presen...
Bianca Schroeder, Garth A. Gibson
58
Voted
FSTTCS
2008
Springer
14 years 10 months ago
Dynamic matrix rank with partial lookahead
We consider the problem of maintaining information about the rank of a matrix M under changes to its entries. For an n × n matrix M, we show an amortized upper bound of O(nω−1)...
Telikepalli Kavitha
79
Voted
CORR
2006
Springer
138views Education» more  CORR 2006»
14 years 9 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite