Sciweavers

2455 search results - page 414 / 491
» Learning Composite Concepts
Sort
View
IJFCS
2007
105views more  IJFCS 2007»
15 years 4 months ago
On the Existence of Lookahead Delegators for NFA
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and...
Bala Ravikumar, Nicolae Santean
IPM
2007
105views more  IPM 2007»
15 years 4 months ago
Schema and constraints-based matching and merging of Topic Maps
In this paper, we propose a multi-strategic matching and merging approach to find correspondences between ontologies based on the syntactic or semantic characteristics and constr...
Jung-Min Kim, Hyopil Shin, Hyoung-Joo Kim
133
Voted
JAIR
2007
87views more  JAIR 2007»
15 years 4 months ago
Supporting Temporal Reasoning by Mapping Calendar Expressions to Minimal Periodic Sets
In the recent years several research efforts have focused on the concept of time granularity and its applications. A first stream of research investigated the mathematical model...
Claudio Bettini, Sergio Mascetti, Xiaoyang Sean Wa...
CACM
2005
126views more  CACM 2005»
15 years 4 months ago
Extrovert gadgets
This paper presents a set of architectures for the composition of ubiquitous computing applications. It describes research that is being carried out in "extrovert-Gadgets&quo...
Achilles Kameas, Irene Mavrommati
178
Voted
BIBM
2010
IEEE
151views Bioinformatics» more  BIBM 2010»
15 years 2 months ago
Probabilistic topic modeling for genomic data interpretation
Recently, the concept of a species containing both core and distributed genes, known as the supra- or pangenome theory, has been introduced. In this paper, we aim to develop a new ...
Xin Chen, Xiaohua Hu, Xiajiong Shen, Gail Rosen