2712 search results - page 231 / 543 » Sequence Comparison Using a Relational Database Approach |
260
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
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...
166
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
This work investigates personalized social search based on the user’s social relations – search results are re-ranked according to their relations with individuals in the user...
175
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Last years' mapping of diverse genomes has generated huge amounts of biological data which are currently dispersed through many databases. Integration of the info...
262
click to vote
ICDE
2003
IEEE
16 years 8 months ago
2003
IEEE
Iceberg-cube mining is to compute the GROUP BY partitions, for all GROUP BY dimension lists, that satisfy a given aggregate constraint. Previous works have pushed anti-monotone co...
190
click to vote
EDBT
2010
ACM
16 years 1 months ago
2010
ACM
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...