Sciweavers

16666 search results - page 7 / 3334
» Descriptive and Computational Complexity
Sort
View
FIMI
2003
84views Data Mining» more  FIMI 2003»
13 years 8 months ago
Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization
We describe an implementation of an algorithm for enumerating all maximal frequent sets using irredundant dualization, which is an improved version of that of Gunopulos et al. The...
Takeaki Uno, Ken Satoh
DLOG
2001
13 years 8 months ago
On Expressive Number Restrictions in Description Logics
We consider expressive Description Logics (ALCN) allowing for number restrictions on complex roles built with combinations of role constructors. In particular, we are mainly inter...
Fabio Grandi
ESWA
2008
123views more  ESWA 2008»
13 years 6 months ago
Computing context-dependent temporal diagnosis in complex domains
Over the years, many Artificial Intelligence (AI) approaches have dealt with the diagnosis problem and its application in complex environments such as medical domains. Model-Based...
José M. Juárez, Manuel Campos, Jos&e...
CN
2008
98views more  CN 2008»
13 years 7 months ago
Description and simulation of dynamic mobility networks
During the last decade, the study of large scale complex networks has attracted a substantial amount of attention and works from several domains: sociology, biology, computer scie...
Antoine Scherrer, Pierre Borgnat, Eric Fleury, Jea...
DAC
1996
ACM
13 years 11 months ago
A Description Language for Design Process Management
A language for defining design discipline characteristics is proesign discipline characteristics such as abstraction levels, design object classifications and decompositions, desi...
Peter R. Sutton, Stephen W. Director