3136 search results - page 319 / 628 » Comparison of Clique-Listing Algorithms |
190
click to vote
ESA
2005
Springer
16 years 5 days ago
2005
Springer
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
210
click to vote
ADC
2003
Springer
15 years 12 months ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
156
click to vote
VLDB
2001
ACM
15 years 11 months ago
2001
ACM
Bulk loading refers to the process of creating an index from scratch for a given data set. This problem is well understood for B-trees, but so far, non-traditional index structure...
177
click to vote
VISUALIZATION
2000
IEEE
15 years 11 months ago
2000
IEEE
Visualization algorithms have seen substantial improvements in the past several years. However, very few algorithms have been developed for directly studying data in dimensions hi...
189
click to vote
ETRA
2000
ACM
15 years 10 months ago
2000
ACM
The process of fixation identification--separating and labeling fixations and saccades in eye-tracking protocols--is an essential part of eye-movement data analysis and can have a...