Sciweavers

145 search results - page 27 / 29
» Parameterized Complexity Classes under Logical Reductions
Sort
View
PODS
2009
ACM
171views Database» more  PODS 2009»
14 years 7 months ago
XML schema mappings
Relational schema mappings have been extensively studied in connection with data integration and exchange problems, but mappings between XML schemas have not received the same amo...
Shun'ichi Amano, Leonid Libkin, Filip Murlak
CCA
2009
Springer
14 years 1 months ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
Vasco Brattka, Guido Gherardi
ALT
1995
Springer
13 years 11 months ago
Learning Unions of Tree Patterns Using Queries
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara
MIE
2008
116views Healthcare» more  MIE 2008»
13 years 8 months ago
Gene Regulation Ontology (GRO): Design Principles and Use Cases
The Gene Regulation Ontology (GRO) is designed as a novel approach to model complex events that are part of the gene regulatory processes. We introduce the design requirements for ...
Elena Beisswanger, Vivian Lee, Jung-jae Kim, Dietr...
EUSFLAT
2007
156views Fuzzy Logic» more  EUSFLAT 2007»
13 years 8 months ago
Fuzzy Calculating and Fuzzy Control in Wireless Sensor Network
At present time configurable wireless sensor networks are given special consideration. Wireless sensor networks are now a static elements union. To make such a network a powerful ...
Irina Kalganova