Sciweavers

7150 search results - page 1192 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
16 years 7 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
KDD
2004
ACM
168views Data Mining» more  KDD 2004»
16 years 7 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 6 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 6 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
OSDI
2008
ACM
16 years 6 months ago
Probabilistic Inference in Queueing Networks
Although queueing models have long been used to model the performance of computer systems, they are out of favor with practitioners, because they have a reputation for requiring u...
Charles A. Sutton, Michael I. Jordan
« Prev « First page 1192 / 1430 Last » Next »