815 search results - page 18 / 163 » Approximate Entropy Reducts |
RECOMB
2003
Springer
15 years 9 months ago
2003
Springer
We propose a framework for modeling sequence motifs based on the maximum entropy principle (MEP). We recommend approximating short sequence motif distributions with the maximum en...
TSMC
2010
14 years 4 months ago
2010
The original rough-set model is primarily concerned with the approximations of sets described by a single equivalence relation on a given universe. With granular computing point of...
CIARP
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. An important problem in the bioinformatics field is to understand how genes are regulated and interact through gene networks. This knowledge can be helpful for many appl...
ASIACRYPT
2011
Springer
13 years 9 months ago
2011
Springer
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
SIGIR
2008
ACM
14 years 9 months ago
2008
ACM
Over the years, the notion of concept relatedness has attracted considerable attention. A variety of approaches, based on ontology structure, information content, association, or ...