Sciweavers

318 search results - page 24 / 64
» A New Indexing Method for Approximate String Matching
Sort
View
184
Voted
DBA
2006
236views Database» more  DBA 2006»
15 years 5 months ago
Quantizing Time Series for Efficient Subsequence Matching
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data ...
Inés Fernando Vega López, Bongki Moo...
135
Voted
WWW
2003
ACM
16 years 4 months ago
Text joins in an RDBMS for web data integration
The integration of data produced and collected across autonomous, heterogeneous web services is an increasingly important and challenging problem. Due to the lack of global identi...
Luis Gravano, Panagiotis G. Ipeirotis, Nick Koudas...
144
Voted
ESA
2006
Springer
136views Algorithms» more  ESA 2006»
15 years 7 months ago
Approximation in Preemptive Stochastic Online Scheduling
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
Nicole Megow, Tjark Vredeveld
274
Voted
ICDE
1999
IEEE
209views Database» more  ICDE 1999»
16 years 5 months ago
Efficient Time Series Matching by Wavelets
Time series stored as feature vectors can be indexed by multidimensional index trees like R-Trees for fast retrieval. Due to the dimensionality curse problem, transformations are ...
Kin-pong Chan, Ada Wai-Chee Fu
155
Voted
WOB
2004
120views Bioinformatics» more  WOB 2004»
15 years 5 months ago
Reconfigurable Systems for Sequence Alignment and for General Dynamic Programming
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...
Ricardo P. Jacobi, Mauricio Ayala-Rincón, L...