4541 search results - page 85 / 909 » Cache-Oblivious Algorithms and Data Structures |
IOPADS
1996
15 years 15 days ago
1996
The ability to perform permutations of large data sets in place reduces the amount of necessary available disk storage. The simplest way to perform a permutation often is to read ...
101
click to vote
CVPR
2004
IEEE
16 years 1 months ago
2004
IEEE
Subspace clustering has many applications in computer vision, such as image/video segmentation and pattern classification. The major issue in subspace clustering is to obtain the ...
123
click to vote
SDM
2011
SIAM
14 years 2 months ago
2011
SIAM
A binary matrix is fully nested if its columns form a chain of subsets; that is, any two columns are ordered by the subset relation, where we view each column as a subset of the r...
104
click to vote
PODC
2010
ACM
15 years 1 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
111
click to vote
JGAA
2007
14 years 11 months ago
2007
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...