282 search results - page 25 / 57 » Browsing and Searching Software Architectures |
111
click to vote
BIBE
2008
IEEE
15 years 5 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
ICMCS
2005
IEEE
15 years 4 months ago
2005
IEEE
Due to the enormous increase in the stored digital contents, search and retrieval functionalities are necessary in multimedia systems. Though processor speed for standard PCs (Per...
ICCD
2008
IEEE
15 years 5 months ago
2008
IEEE
Abstract— World data is increasing rapidly, doubling almost every three years[1][2]. To comprehend and use this data effectively, search and recognition (SR) applications will de...
82
Voted
ISPDC
2008
IEEE
15 years 5 months ago
2008
IEEE
Multi–comparand associative processors are efficient in parallel processing of complex search problems that arise from many application areas including computational geometry, ...
VRST
2009
ACM
15 years 5 months ago
2009
ACM
For the convenient reuse of large-scale 3D motion capture data, browsing and searching methods for the data should be explored. In this paper, an efficient indexing and retrieval...