Sciweavers

229 search results - page 31 / 46
» Speeding Up Two String-Matching Algorithms
Sort
View
ICDE
2010
IEEE
568views Database» more  ICDE 2010»
14 years 7 months ago
Reverse Top-k Queries
Rank-aware query processing has become essential for many applications that return to the user only the top-k objects based on the individual user's preferences. Top-k queries...
Akrivi Vlachou, Christos Doulkeridis, Kjetil N&osl...
NIXDORF
1992
116views Hardware» more  NIXDORF 1992»
13 years 11 months ago
Programmable Active Memories: A Performance Assessment
We present some quantitative performance measurements for the computing power of Programmable Active Memories (PAM), as introduced by [2]. Based on Field Programmable Gate Array (...
Patrice Bertin, Didier Roncin, Jean Vuillemin
DEBU
2010
128views more  DEBU 2010»
13 years 4 months ago
Designing Database Operators for Flash-enabled Memory Hierarchies
Flash memory affects not only storage options but also query processing. In this paper, we analyze the use of flash memory for database query processing, including algorithms that...
Goetz Graefe, Stavros Harizopoulos, Harumi A. Kuno...
ACISICIS
2009
IEEE
13 years 10 months ago
A Novel Approach Based on PCNNs Template for Fingerprint Image Thinning
A PCNNs-based square-and-triangle-template method for binary fingerprint image thinning is proposed. The algorithm is iterative, in which a combined sequential and parallel proces...
Dacheng Xu, Bailiang Li, Anton Nijholt
ICDE
2009
IEEE
173views Database» more  ICDE 2009»
14 years 9 months ago
Efficient Processing of Warping Time Series Join of Motion Capture Data
Discovering non-trivial matching subsequences from two time series is very useful in synthesizing novel time series. This can be applied to applications such as motion synthesis wh...
Yueguo Chen, Gang Chen, Ke Chen, Beng Chin Ooi