Sciweavers

320 search results - page 10 / 64
» A New Compression Method with Fast Searching on Large Databa...
Sort
View
GCB
2004
Springer
223views Biometrics» more  GCB 2004»
13 years 11 months ago
PoSSuMsearch: Fast and Sensitive Matching of Position Specific Scoring Matrices using Enhanced Suffix Arrays
: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs. In this paper, we present a new nonheuristic algorithm, ...
Michael Beckstette, Dirk Strothmann, Robert Homann...
IV
1999
IEEE
91views Visualization» more  IV 1999»
13 years 11 months ago
Triangle Mesh Compression for Fast Rendering
Modern GIS(Geographic Information System) application programs and simulation systems have to handle large datasets for rendering. Currently three dimensional rendering hardware a...
Dong-Gyu Park, Yang-Soo Kim, Hwan-Gue Cho
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
14 years 4 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat
TIP
1998
159views more  TIP 1998»
13 years 7 months ago
An optimal quadtree-based motion estimation and motion-compensated interpolation scheme for video compression
Abstract—In this paper, we propose an optimal quadtree (QT)based motion estimator for video compression. It is optimal in the sense that for a given bit budget for encoding the d...
Guido M. Schuster, Aggelos K. Katsaggelos
DATESO
2007
157views Database» more  DATESO 2007»
13 years 8 months ago
Index-Based Approach to Similarity Search in Protein and Nucleotide Databases
When searching databases of nucleotide or protein sequences, finding a local alignment of two sequences is one of the main tasks. Since the sizes of available databases grow const...
David Hoksza, Tomás Skopal