962 search results - page 147 / 193 » Efficient Algorithms for Eulerian Extension |
134
click to vote
KDD
2009
ACM
16 years 4 months ago
2009
ACM
Probabilistic frequent itemset mining in uncertain transaction databases semantically and computationally differs from traditional techniques applied to standard "certain&quo...
144
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
122
click to vote
RECOMB
2004
Springer
16 years 4 months ago
2004
Springer
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
108
click to vote
RECOMB
2003
Springer
16 years 4 months ago
2003
Springer
Large-scale comparison of genomic DNA is of fundamental importance in annotating functional elements of genomes. To perform large comparisons efficiently, BLAST (Methods: Companio...
229
click to vote
VLDB
2004
ACM
16 years 4 months ago
2004
ACM
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...