Sciweavers

4526 search results - page 559 / 906
» An overview of clustering methods
Sort
View
ESCIENCE
2006
IEEE
16 years 26 days ago
Grid Approach to Embarrassingly Parallel CPU-Intensive Bioinformatics Problems
Bioinformatics algorithms such as sequence alignment methods based on profile-HMM (Hidden Markov Model) are popular but CPU-intensive. If large amounts of data are processed, a s...
Heinz Stockinger, Marco Pagni, Lorenzo Cerutti, La...
CIKM
2005
Springer
16 years 10 days ago
Minimal document set retrieval
This paper presents a novel formulation and approach to the minimal document set retrieval problem. Minimal Document Set Retrieval (MDSR) is a promising information retrieval task...
Wei Dai, Rohini K. Srihari
SC
2004
ACM
16 years 7 days ago
A Parallel Implementation of 4-Dimensional Haralick Texture Analysis for Disk-Resident Image Datasets
Texture analysis is one possible method to detect features in biomedical images. During texture analysis, texture related information is found by examining local variations in ima...
Brent Woods, Bradley D. Clymer, Joel H. Saltz, Tah...
ICDCS
2010
IEEE
15 years 10 months ago
Sifting through Network Data to Cull Activity Patterns with HEAPs
—Today’s large campus and enterprise networks are characterized by their complexity, i.e. containing thousands of hosts, and diversity, i.e. with various applications and usage...
Esam Sharafuddin, Yu Jin, Nan Jiang, Zhi-Li Zhang
ADBIS
2000
Springer
91views Database» more  ADBIS 2000»
15 years 10 months ago
Efficient Region Query Processing by Optimal Page Ordering
A number of algorithms of clustering spatial data for reducing the number of disk seeks required to process spatial queries have been developed. One of the algorithms is the scheme...
Daesoo Cho, Bonghee Hong