Sciweavers

4536 search results - page 99 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
IOPADS
1996
87views more  IOPADS 1996»
13 years 10 months ago
Structured Permuting in Place on Parallel Disk Systems
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 ...
Leonard F. Wisniewski
PVLDB
2010
103views more  PVLDB 2010»
13 years 7 months ago
Fast Optimal Twig Joins
In XML search systems twig queries specify predicates on node values and on the structural relationships between nodes, and a key operation is to join individual query node matche...
Nils Grimsmo, Truls Amundsen Bjørklund, Mag...
CVPR
2004
IEEE
14 years 11 months ago
Robust Subspace Clustering by Combined Use of kNND Metric and SVD Algorithm
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 ...
Qifa Ke, Takeo Kanade
SDM
2011
SIAM
218views Data Mining» more  SDM 2011»
12 years 12 months ago
Segmented nestedness in binary data
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...
Esa Junttila, Petteri Kaski
TSP
2010
13 years 3 months ago
Multichannel fast QR-decomposition algorithms: weight extraction method and its applications
Abstract--Multichannel fast QR decomposition RLS (MCFQRD-RLS) algorithms are well known for their good numerical properties and low computational complexity. The main limitation is...
Mobien Shoaib, Stefan Werner, José Antonio ...