Sciweavers

5877 search results - page 429 / 1176
» Advanced High Performance Algorithms for Data Processing
Sort
View
ITSL
2008
15 years 8 months ago
An Empirical Comparison of NML Clustering Algorithms
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
Petri Kontkanen, Petri Myllymäki
ICASSP
2009
IEEE
16 years 1 months ago
Convex analysis based minimum-volume enclosing simplex algorithm for hyperspectral unmixing
Abstract—Hyperspectral unmixing aims at identifying the hidden spectral signatures (or endmembers) and their corresponding proportions (or abundances) from an observed hyperspect...
Tsung-Han Chan, Chong-Yung Chi, Yu-Min Huang, Wing...
BMCBI
2010
154views more  BMCBI 2010»
15 years 7 months ago
An algorithm for automated closure during assembly
Background: Finishing is the process of improving the quality and utility of draft genome sequences generated by shotgun sequencing and computational assembly. Finishing can invol...
Sergey Koren, Jason R. Miller, Brian Walenz, Grang...
IEEEPACT
2000
IEEE
15 years 11 months ago
Exploring the Limits of Sub-Word Level Parallelism
Multimedia instruction set extensions have become a prominent feature in desktop microprocessor platforms, promising superior performance on a wide range of floating-point and int...
Kevin Scott, Jack W. Davidson
DEXA
2006
Springer
193views Database» more  DEXA 2006»
15 years 10 months ago
Understanding and Enhancing the Folding-In Method in Latent Semantic Indexing
Abstract. Latent Semantic Indexing(LSI) has been proved to be effective to capture the semantic structure of document collections. It is widely used in content-based text retrieval...
Xiang Wang 0002, Xiaoming Jin