Sciweavers

6388 search results - page 347 / 1278
» High Performance Data Mining
Sort
View
SAC
2002
ACM
15 years 6 months ago
The P-tree algebra
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
Qin Ding, Maleq Khan, Amalendu Roy, William Perriz...
FAST
2010
15 years 9 months ago
I/O Deduplication: Utilizing Content Similarity to Improve I/O Performance
Duplication of data in storage systems is becoming increasingly common. We introduce I/O Deduplication, a storage optimization that utilizes content similarity for improving I/O p...
Ricardo Koller, Raju Rangaswami
CONCURRENCY
2004
151views more  CONCURRENCY 2004»
15 years 6 months ago
User transparency: a fully sequential programming model for efficient data parallel image processing
Although many image processing applications are ideally suited for parallel implementation, most researchers in imaging do not benefit from high performance computing on a daily b...
Frank J. Seinstra, Dennis Koelma
IJCNLP
2005
Springer
16 years 9 days ago
Web-Based Terminology Translation Mining
Mining terminology translation from a large amount of Web data can be applied in many fields such as reading/writing assistant, machine translation and cross-language information r...
Gaolin Fang, Hao Yu, Fumihito Nishino
AUSAI
2004
Springer
15 years 10 months ago
Using Classification to Evaluate the Output of Confidence-Based Association Rule Mining
Abstract. Association rule mining is a data mining technique that reveals interesting relationships in a database. Existing approaches employ different parameters to search for int...
Stefan Mutter, Mark Hall, Eibe Frank