Sciweavers

WILF
2005
Springer
96views Fuzzy Logic» more  WILF 2005»
14 years 1 months ago
Imprecise Temporal Interval Relations
Abstract. When the time span of an event is imprecise, it can be represented by a fuzzy set, called a fuzzy time interval. In this paper we propose a representation for 13 relation...
Steven Schockaert, Martine De Cock, Etienne E. Ker...
WILF
2005
Springer
124views Fuzzy Logic» more  WILF 2005»
14 years 1 months ago
Possibilistic Planning Using Description Logics: A First Step
Abstract. This paper is a first step in the direction of extending possibilistic planning to take advantage of the expressive power and reasoning capabilities of fuzzy description...
Célia da Costa Pereira, Andrea Tettamanzi
WILF
2005
Springer
185views Fuzzy Logic» more  WILF 2005»
14 years 1 months ago
SVM Classification of Neonatal Facial Images of Pain
This paper reports experiments that explore performance differences in two previous studies that investigated SVM classification of neonatal pain expressions using the Infant COPE ...
Sheryl Brahnam, Chao-Fa Chuang, Frank Y. Shih, Mel...
WILF
2005
Springer
194views Fuzzy Logic» more  WILF 2005»
14 years 1 months ago
Learning Bayesian Classifiers from Gene-Expression MicroArray Data
Computing methods that allow the efficient and accurate processing of experimentally gathered data play a crucial role in biological research. The aim of this paper is to present a...
Andrea Bosin, Nicoletta Dessì, Diego Libera...
WILF
2005
Springer
112views Fuzzy Logic» more  WILF 2005»
14 years 1 months ago
NEC for Gene Expression Analysis
Aim of this work is to apply a novel comprehensive machine learning tool for data mining to preprocessing and interpretation of gene expression data. Furthermore, some visualizatio...
Roberto Amato, Angelo Ciaramella, N. Deniskina, Ca...
WIA
2005
Springer
14 years 1 months ago
Compressing XML Documents Using Recursive Finite State Automata
Abstract. We propose a scheme for automatically generating compressors for XML documents from Document Type Definition(DTD) specifications. Our algorithm is a lossless adaptive a...
Hariharan Subramanian, Priti Shankar
WIA
2005
Springer
14 years 1 months ago
Tree Automata and XPath on Compressed Trees
The complexity of various membership problems for tree automata on compressed trees is analyzed. Two compressed representations are considered: dags, which allow to share identical...
Markus Lohrey, Sebastian Maneth