Sciweavers

635 search results - page 32 / 127
» Some Computational Problems Related to Pseudo-intents
Sort
View
GRC
2007
IEEE
15 years 4 months ago
MGRS in Incomplete Information Systems
The original rough set model is concerned primarily with the approximation of sets described by single binary relation on the universe. In the view of granular computing, classica...
Yuhua Qian, Jiye Liang, Chuangyin Dang
BIODATAMINING
2008
120views more  BIODATAMINING 2008»
14 years 9 months ago
Filling the gap between biology and computer science
This editorial introduces BioData Mining, a new journal which publishes research articles related to advances in computational methods and techniques for the extraction of useful ...
Jesús S. Aguilar-Ruiz, Jason H. Moore, Mary...
MOC
1998
93views more  MOC 1998»
14 years 9 months ago
Computing ray class groups, conductors and discriminants
We use the algorithmic computation of exact sequences of Abelian groups to compute the complete structure of (ZK /m)∗ for an ideal m of a number field K, as well as ray class gr...
Henri Cohen, Francisco Diaz y Diaz, Michel Olivier
BMCBI
2006
145views more  BMCBI 2006»
14 years 9 months ago
Fast-Find: A novel computational approach to analyzing combinatorial motifs
Background: Many vital biological processes, including transcription and splicing, require a combination of short, degenerate sequence patterns, or motifs, adjacent to defined seq...
Micah Hamady, Erin Peden, Rob Knight, Ravinder Sin...
AI
2010
Springer
14 years 9 months ago
Updating action domain descriptions
How can an intelligent agent update her knowledge base about an action domain, relative to some conditions (possibly obtained from earlier observations)? We study this question in...
Thomas Eiter, Esra Erdem, Michael Fink, Ján...