Sciweavers

61 search results - page 9 / 13
» Improving efficiency of fingerprint matching by minutiae ind...
Sort
View
PADL
2009
Springer
14 years 9 months ago
Using Bloom Filters for Large Scale Gene Sequence Analysis in Haskell
Analysis of biological data often involves large data sets and computationally expensive algorithms. Databases of biological data continue to grow, leading to an increasing demand ...
Ketil Malde, Bryan O'Sullivan
FOCS
2009
IEEE
14 years 12 days ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
SIGMOD
2001
ACM
213views Database» more  SIGMOD 2001»
14 years 8 months ago
Bit-Sliced Index Arithmetic
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...
Denis Rinfret, Patrick E. O'Neil, Elizabeth J. O'N...
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
14 years 8 months ago
Approximate embedding-based subsequence matching of time series
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
Vassilis Athitsos, Panagiotis Papapetrou, Michalis...
VLDB
2000
ACM
99views Database» more  VLDB 2000»
14 years 2 days ago
Efficient Filtering of XML Documents for Selective Dissemination of Information
Information Dissemination applications are gaining increasing popularity due to dramatic improvements in communications bandwidth and ubiquity. The sheer volume of data available ...
Mehmet Altinel, Michael J. Franklin