Rank-one completions of partial matrices and completely rank-nonincreasing linear functionals
MetadataShow full item record
We obtain necessary and sufficient conditions for the existence and the uniqueness of rank-one completions of a partial matrix, and we verify a conjecture of Hadwin and Larson concerning the nature of completely rank-nonincreasing linear functionals defined on pattern subspaces.
Showing items related by title, author, creator and subject.
Probabilistic models over ordered partitions with applications in document ranking and collaborative filteringTran, Truyen; Phung, Dinh; Venkatesh, Svetha (2011)Ranking is an important task for handling a large amount of content. Ideally, training data for supervised ranking would include a complete rank of documents (or other objects such as images or videos) for a particular ...
Huang, Karl ; Neylon, Cameron ; Brookes-Kenworthy, Chloe ; Hosking, Richard ; Montgomery, Lucy ; Wilson, Katie ; Ozaygen, Alkim (2019)Universities are increasingly evaluated on the basis of their outputs. These are often converted to simple and contested rankings with substantial implications for recruitment, income, and perceived prestige. Such evaluation ...
Zhu, W.; Berndsen, A.; Madsen, E.; Tan, M.; Stairs, I.; Brazier, A.; Lazarus, P.; Lynch, R.; Scholz, P.; Stovall, K.; Ransom, S.; Banaszak, S.; Biwer, C.; Cohen, S.; Dartez, L.; Flanigan, J.; Lunsford, G.; Martinez, J.; Mata, A.; Rohr, M.; Walker, A.; Allen, B.; Bhat, Ramesh; Bogdanova, S.; Camilo, F.; Chatterjee, S.; Cordes, J.; Crawford, F.; Deneva, J.; Desvignes, G.; Ferdman, R.; Freire, P.; Hessels, J.; Jenet, F.; Kaplan, D.; Kaspi, V.; Knispel, B.; Lee, K.; van Leeuwen, J.; Lyne, A.; McLaughlin, M.; Siemens, X.; Spitler, L.; Venkataraman, A. (2014)In the modern era of big data, many fields of astronomy are generating huge volumes of data, the analysis of which can sometimes be the limiting factor in research. Fortunately, computer scientists have developed powerful ...