Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q17092365> ?p ?o }
Showing triples 1 to 68 of
68
with 100 triples per page.
- Q17092365 subject Q6975251.
- Q17092365 subject Q8269001.
- Q17092365 subject Q9245233.
- Q17092365 abstract "In-place matrix transposition, also called in-situ matrix transposition, is the problem of transposing an N×M matrix in-place in computer memory, ideally with O(1) (bounded) additional storage, or at most with additional storage much less than NM. Typically, the matrix is assumed to be stored in row-major order or column-major order (i.e., contiguous rows or columns, respectively, arranged consecutively).Performing an in-place transpose (in-situ transpose) is most difficult when N ≠ M, i.e. for a non-square (rectangular) matrix, where it involves a complicated permutation of the data elements, with many cycles of length greater than 2. In contrast, for a square matrix (N = M), all of the cycles are of length 1 or 2, and the transpose can be achieved by a simple loop to swap the upper triangle of the matrix with the lower triangle. Further complications arise if one wishes to maximize memory locality in order to improve cache line utilization or to operate out-of-core (where the matrix does not fit into main memory), since transposes inherently involve non-consecutive memory accesses.The problem of non-square in-place transposition has been studied since at least the late 1950s, and several algorithms are known, including several which attempt to optimize locality for cache, out-of-core, or similar memory-related contexts.".
- Q17092365 wikiPageExternalLink 307799.html.
- Q17092365 wikiPageExternalLink ParTranspose2.pdf.
- Q17092365 wikiPageExternalLink 12.995452.
- Q17092365 wikiPageExternalLink fftw-paper-ieee.pdf.
- Q17092365 wikiPageExternalLink 680211b3fbac30c4?hl=en.
- Q17092365 wikiPageExternalLink 00814600.pdf?arnumber=814600.
- Q17092365 wikiPageExternalLink citation.cfm?id=355719.355729&coll=GUIDE&dl=GUIDE&CFID=436989&CFTOKEN=18491885.
- Q17092365 wikiPageExternalLink citation.cfm?id=362368&dl=GUIDE&coll=GUIDE&CFID=436989&CFTOKEN=18491885.
- Q17092365 wikiPageExternalLink citation.cfm?id=362542&dl=GUIDE&coll=GUIDE&CFID=436989&CFTOKEN=18491885.
- Q17092365 wikiPageExternalLink citation.cfm?id=363304&dl=GUIDE&coll=GUIDE&CFID=436989&CFTOKEN=18491885.
- Q17092365 wikiPageExternalLink offt.html.
- Q17092365 wikiPageExternalLink abstract4.html.
- Q17092365 wikiPageExternalLink www.fftw.org.
- Q17092365 wikiPageExternalLink 380.
- Q17092365 wikiPageExternalLink 467.
- Q17092365 wikiPageExternalLink 513.
- Q17092365 wikiPageExternalLink Home.
- Q17092365 wikiPageWikiLink Q104752.
- Q17092365 wikiPageWikiLink Q1136880.
- Q17092365 wikiPageWikiLink Q12479.
- Q17092365 wikiPageWikiLink Q128751.
- Q17092365 wikiPageWikiLink Q131752.
- Q17092365 wikiPageWikiLink Q15777.
- Q17092365 wikiPageWikiLink Q161519.
- Q17092365 wikiPageWikiLink Q17457.
- Q17092365 wikiPageWikiLink Q1799665.
- Q17092365 wikiPageWikiLink Q179976.
- Q17092365 wikiPageWikiLink Q186152.
- Q17092365 wikiPageWikiLink Q1868547.
- Q17092365 wikiPageWikiLink Q18753781.
- Q17092365 wikiPageWikiLink Q188860.
- Q17092365 wikiPageWikiLink Q189224.
- Q17092365 wikiPageWikiLink Q205243.
- Q17092365 wikiPageWikiLink Q212130.
- Q17092365 wikiPageWikiLink Q217608.
- Q17092365 wikiPageWikiLink Q223683.
- Q17092365 wikiPageWikiLink Q2251820.
- Q17092365 wikiPageWikiLink Q232661.
- Q17092365 wikiPageWikiLink Q2393193.
- Q17092365 wikiPageWikiLink Q269878.
- Q17092365 wikiPageWikiLink Q279748.
- Q17092365 wikiPageWikiLink Q339387.
- Q17092365 wikiPageWikiLink Q352090.
- Q17092365 wikiPageWikiLink Q44337.
- Q17092365 wikiPageWikiLink Q4439.
- Q17092365 wikiPageWikiLink Q5015938.
- Q17092365 wikiPageWikiLink Q50708.
- Q17092365 wikiPageWikiLink Q5295.
- Q17092365 wikiPageWikiLink Q5830907.
- Q17092365 wikiPageWikiLink Q623950.
- Q17092365 wikiPageWikiLink Q629202.
- Q17092365 wikiPageWikiLink Q657037.
- Q17092365 wikiPageWikiLink Q68.
- Q17092365 wikiPageWikiLink Q6975251.
- Q17092365 wikiPageWikiLink Q7371746.
- Q17092365 wikiPageWikiLink Q810007.
- Q17092365 wikiPageWikiLink Q82438.
- Q17092365 wikiPageWikiLink Q82571.
- Q17092365 wikiPageWikiLink Q8269001.
- Q17092365 wikiPageWikiLink Q839647.
- Q17092365 wikiPageWikiLink Q8805.
- Q17092365 wikiPageWikiLink Q9245233.
- Q17092365 comment "In-place matrix transposition, also called in-situ matrix transposition, is the problem of transposing an N×M matrix in-place in computer memory, ideally with O(1) (bounded) additional storage, or at most with additional storage much less than NM. Typically, the matrix is assumed to be stored in row-major order or column-major order (i.e., contiguous rows or columns, respectively, arranged consecutively).Performing an in-place transpose (in-situ transpose) is most difficult when N ≠ M, i.e.".
- Q17092365 label "In-place matrix transposition".