Sciweavers

7930 search results - page 1381 / 1586
» Greedy in Approximation Algorithms
Sort
View
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
16 years 5 months ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
16 years 5 months ago
Fast discovery of unexpected patterns in data, relative to a Bayesian network
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
Szymon Jaroszewicz, Tobias Scheffer
140
Voted
KDD
2004
ACM
168views Data Mining» more  KDD 2004»
16 years 5 months ago
Mining, indexing, and querying historical spatiotemporal data
In many applications that track and analyze spatiotemporal data, movements obey periodic patterns; the objects follow the same routes (approximately) over regular time intervals. ...
Nikos Mamoulis, Huiping Cao, George Kollios, Mario...
RECOMB
2006
Springer
16 years 4 months ago
Phylogenetic Profiling of Insertions and Deletions in Vertebrate Genomes
Micro-indels are small insertion or deletion events (indels) that occur during genome evolution. The study of micro-indels is important, both in order to better understand the unde...
Sagi Snir, Lior Pachter
CADE
2008
Springer
16 years 4 months ago
Certifying a Tree Automata Completion Checker
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
Benoît Boyer, Thomas Genet, Thomas P. Jensen
« Prev « First page 1381 / 1586 Last » Next »