6365 search results - page 946 / 1273 » Fast Local Computation Algorithms |
162
click to vote
RECOMB
2002
Springer
16 years 7 months ago
2002
Springer
The field of algorithms for pairwisc biosequence similarity search is dominated by heuristic methods of high efficiency but uncertain sensitivity. One reason that more formal stri...
252
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...
205
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
DNA sequence alignment is a very important problem in bioinformatics. The algorithm proposed by Smith-Waterman (SW) is an exact method that obtains optimal local alignments in qua...
162
click to vote
APCSAC
2005
IEEE
16 years 13 days ago
2005
IEEE
Abstract. Dynamic data redistribution enhances data locality and improves algorithm performance for numerous scientific problems on distributed memory multi-computers systems. Prev...
156
click to vote
DCC
2000
IEEE
15 years 11 months ago
2000
IEEE
We investigate the task of compressing an image by using different probability models for compressing different regions of the image. In an earlier paper, we introduced a class of...