4541 search results - page 638 / 909 » Cache-Oblivious Algorithms and Data Structures |
222
click to vote
BMCBI
2005
15 years 7 months ago
2005
Background: Two of the main objectives of the genomic and post-genomic era are to structurally and functionally annotate genomes which consists of detecting genes' position a...
444
click to vote
ICDE
2000
IEEE
16 years 8 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
176
click to vote
RECOMB
2003
Springer
16 years 7 months ago
2003
Springer
Many genomic sequences and, more generally, (multivariate) time series display tremendous variability. However, often it is reasonable to assume that the sequence is actually gene...
207
click to vote
PDP
2008
IEEE
16 years 1 months ago
2008
IEEE
Search engines use inverted files as index data structures to speed up the solution of user queries. The index is distributed on a set of processors forming a cluster of computer...
158
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Irregular applications, which rely on pointer-based data structures, are often difficult to parallelize. The inputdependent nature of their execution means that traditional paral...