Sciweavers

2088 search results - page 402 / 418
» The Probabilistic Method
Sort
View
KDD
2004
ACM
136views Data Mining» more  KDD 2004»
14 years 8 months ago
A cross-collection mixture model for comparative text mining
In this paper, we define and study a novel text mining problem, which we refer to as Comparative Text Mining (CTM). Given a set of comparable text collections, the task of compara...
ChengXiang Zhai, Atulya Velivelli, Bei Yu
RECOMB
2004
Springer
14 years 7 months ago
Perfect phylogeny and haplotype assignment
This paper is concerned with the reconstruction of perfect phylogenies from binary character data with missing values, and related problems of inferring complete haplotypes from h...
Eran Halperin, Richard M. Karp
RECOMB
2001
Springer
14 years 7 months ago
Finding motifs using random projections
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
Jeremy Buhler, Martin Tompa
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
14 years 7 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner
SIGMOD
2007
ACM
192views Database» more  SIGMOD 2007»
14 years 7 months ago
Benchmarking declarative approximate selection predicates
Declarative data quality has been an active research topic. The fundamental principle behind a declarative approach to data quality is the use of declarative statements to realize...
Amit Chandel, Oktie Hassanzadeh, Nick Koudas, Moha...