99 search results - page 3 / 20 » Improved bounds and new techniques for Davenport-Schinzel se... |
BMCBI
2007
13 years 5 months ago
2007
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
FGR
2006
IEEE
13 years 11 months ago
2006
IEEE
Illumination invariance remains the most researched, yet the most challenging aspect of automatic face recognition. In this paper we propose a novel, general recognition framework...
DCC
2010
IEEE
13 years 5 months ago
2010
IEEE
In [8], the authors formulate new coset bounds for algebraic geometric codes. The bounds give improved lower bounds for the minumum distance of algebraic geometric codes as well a...
IDA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. This work aims to improve an existing time series forecasting algorithm –LBF– by the application of frequent episodes techniques as a complementary step to the model....
GIS
2005
ACM
14 years 6 months ago
2005
ACM
The R*-tree, as a state-of-the-art spatial index, has already found its way into commercial systems like Oracle. In this paper, we aim at improving query performance of the R*tree...