553 search results - page 86 / 111 » Cluster computing for web-scale data processing |
SC
2009
ACM
14 years 2 months ago
2009
ACM
Bioinformatics researchers need efficient means to process large collections of sequence data. One application of interest, genome assembly, has great potential for parallelizati...
PACT
2009
Springer
14 years 2 months ago
2009
Springer
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...
TCSV
2010
13 years 2 months ago
2010
We propose a compressed domain video object segmentation method for MPEG or MPEG-like encoded videos. Computational superiority is the main advantage of the compressed domain proc...
IHI
2010
13 years 2 months ago
2010
Recent advances in healthcare and bioscience technologies and proliferation of portable medical devices are producing massive amounts of multimodal data. The need for parallel pro...
IPPS
2008
IEEE
14 years 2 months ago
2008
IEEE
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...