Sciweavers

FUIN
2008
119views more  FUIN 2008»
14 years 4 days ago
Modeling Communication with Synchronized Environments
A deterministic behavior of systems composed of several modules is a desirable design goal. Assembling a complex system from components requires also a high degree of re-usability....
Tiberiu Seceleanu, Axel Jantsch
FUIN
2008
96views more  FUIN 2008»
14 years 4 days ago
Computational Efficiency of Intermolecular Gene Assembly
In this paper, we investigate the computational efficiency of gene rearrangement operations found in ciliates, a type of unicellular organisms. We show how the so-called guided re...
Tseren-Onolt Ishdorj, Remco Loos, Ion Petre
FUIN
2008
73views more  FUIN 2008»
14 years 4 days ago
On Krivine's Realizability Interpretation of Classical Second-Order Arithmetic
This article investigates Krivine's realizability interpretation of classical second-order arithmetic and its recent extension handling countable choice. We will start by pre...
Paulo Oliva, Thomas Streicher
FUIN
2008
80views more  FUIN 2008»
14 years 4 days ago
External Memory Algorithms for String Problems
In this paper we present external memory algorithms for some string problems. External memory algorithms have been developed in many research areas, as the speed gap between fast ...
Kangho Roh, Maxime Crochemore, Costas S. Iliopoulo...
FUIN
2008
108views more  FUIN 2008»
14 years 4 days ago
A Simple Proof of Miller-Yu Theorem
A few years ago a nice criterion of Martin-L
Laurent Bienvenu, Wolfgang Merkle, Alexander Shen
FUIN
2008
76views more  FUIN 2008»
14 years 4 days ago
Prescribed Learning of Indexed Families
Abstract. This work extends studies of Angluin, Lange and Zeugmann on how learnability of a language class depends on the hypothesis space used by the learner. While previous studi...
Sanjay Jain, Frank Stephan, Nan Ye
FUIN
2008
71views more  FUIN 2008»
14 years 4 days ago
Nonterminal Complexity of Some Operations on Context-Free Languages
: We investigate context-free languages with respect to the measure Var of descriptional complexity, which gives the minimal number of nonterminals which is necessary to generate t...
Jürgen Dassow, Ralf Stiebe
FUIN
2008
80views more  FUIN 2008»
14 years 4 days ago
An Algorithmic Solution of a Birkhoff Type Problem
We give an algorithmic solution in a simple combinatorial data of Birkhoff s type problem studied in [14], for the category repft(I, K[t]/(tm)) of filtered I-chains of modules over...
Daniel Simson, Mariusz Wojewódzki
FUIN
2008
116views more  FUIN 2008»
14 years 4 days ago
On the Relationship between Description Logic-based and F-Logic-based Ontologies
Many popular ontology languages are based on (subsets of) first-order predicate logic, with classes represented by unary predicates and properties by binary predicates. Specificall...
Jos de Bruijn, Stijn Heymans