2514 search results - page 195 / 503 » On the Computation of Approximations of Database Queries |
267
click to vote
ICDE
1999
IEEE
16 years 8 months ago
1999
IEEE
Nowadays, structured data such as sales and business forms are stored in data warehouses for decision makers to use. Further, unstructured data such as emails, html texts, images,...
268
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Existing work on similar sequence matching has focused on either whole matching or range subsequence matching. In this paper, we present novel methods for ranked subsequence match...
194
click to vote
PSB
2003
15 years 8 months ago
2003
A number of biological applications require comparison of large genome strings. Current techniques suffer from both disk I/O and computational cost because of extensive memory req...
148
click to vote
ISSADS
2005
Springer
16 years 3 days ago
2005
Springer
A hierarchy is an arrangement of qualitative values in a tree with certain properties. Hierarchies allow to define the confusion conf(r, s) in using qualitative value r instead of ...
159
click to vote
IPPS
2005
IEEE
16 years 5 days ago
2005
IEEE
The computational power needed for searching exponentially growing databases, such as GenBank, has increased dramatically. Three different implementations of the most widely used ...