42230 search results - page 7906 / 8446 » Algorithms and Complexity Results for |
240
Voted
KDD
2003
ACM
16 years 7 months ago
2003
ACM
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
229
Voted
KDD
2002
ACM
16 years 7 months ago
2002
ACM
Multimedia Data Mining requires the ability to automatically analyze and understand the content. The Community of Multimedia Agents project (COMMA) is devoted to creating an open ...
204
Voted
KDD
2001
ACM
16 years 7 months ago
2001
ACM
We introduce and evaluate TreeDT, a novel gene mapping method which is based on discovering and assessing tree-like patterns in genetic marker data. Gene mapping aims at discoveri...
318
Voted
POPL
2006
ACM
16 years 7 months ago
2006
ACM
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
207
Voted
RECOMB
2006
Springer
16 years 7 months ago
2006
Springer
Abstract. So far, most methods for identifying sequences under selection based on comparative sequence data have either assumed selectional pressures are the same across all branch...