Sciweavers

4155 search results - page 654 / 831
» External Memory Algorithms
Sort
View
116
Voted
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
15 years 6 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
DEXA
2001
Springer
151views Database» more  DEXA 2001»
15 years 5 months ago
Cache Conscious Clustering C3
The two main techniques of improving I/O performance of Object Oriented Database Management Systems(OODBMS) are clustering and buffer replacement. Clustering is the placement of o...
Zhen He, Alonso Marquez
ISSTA
2000
ACM
15 years 5 months ago
Which pointer analysis should I use?
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...
Michael Hind, Anthony Pioli
COMPGEOM
2011
ACM
14 years 4 months ago
Persistence-based clustering in riemannian manifolds
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
Frédéric Chazal, Leonidas J. Guibas,...
106
Voted
CVPR
2007
IEEE
16 years 2 months ago
Hybrid learning of large jigsaws
A jigsaw is a recently proposed generative model that describes an image as a composition of non-overlapping patches of varying shape, extracted from a latent image. By learning t...
Julia A. Lasserre, Anitha Kannan, John M. Winn