Sciweavers

2593 search results - page 511 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
COMPGEOM
2007
ACM
13 years 11 months ago
Kinetic KD-trees and longest-side KD-trees
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann
BIRD
2008
Springer
162views Bioinformatics» more  BIRD 2008»
13 years 9 months ago
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
Maria Federico, Nadia Pisanti
BMCBI
2008
131views more  BMCBI 2008»
13 years 7 months ago
CoCoNUT: an efficient system for the comparison and analysis of genomes
Background: Comparative genomics is the analysis and comparison of genomes from different species. This area of research is driven by the large number of sequenced genomes and hea...
Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohl...
CGF
2010
144views more  CGF 2010»
13 years 7 months ago
Illustrative White Matter Fiber Bundles
Diffusion Tensor Imaging (DTI) has made feasible the visualization of the fibrous structure of the brain white matter. In the last decades, several fiber-tracking methods have bee...
Ron Otten, Anna Vilanova, Huub van De Wetering
PR
2008
117views more  PR 2008»
13 years 7 months ago
A scale-free distribution of false positives for a large class of audio similarity measures
The "bag-of-frames" approach (BOF) to audio pattern recognition models signals as the long-term statistical distribution of their local spectral features, a prototypical...
Jean-Julien Aucouturier, François Pachet