804 search results - page 41 / 161 » Experiments on Union-Find Algorithms for the Disjoint-Set Da... |
FIMI
2004
13 years 9 months ago
2004
Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related tec...
METMBS
2004
13 years 9 months ago
2004
As more research centers embark on sequencing new genomes, the problem of DNA fragment assembly for shotgun sequencing is growing in importance and complexity. Accurate and fast a...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Multibody grouping is a representative of applying subspace constraints in computer vision tasks. Under linear projection models, feature points of multibody reside in multiple su...
ISCAS
2005
IEEE
14 years 1 months ago
2005
IEEE
— We present a frequency-domain method of noisy convolutive source separation, where we extends the SEONS algorithm [2] that jointly exploits the nonstationarity and temporal str...
AUTOID
2005
IEEE
14 years 1 months ago
2005
IEEE
In a biometrics scenario, gallery images are enrolled into the database ahead of the matching step, which gives us the opportunity to build related data structures before the prob...