Sciweavers

213 search results - page 32 / 43
» Relating Word and Tree Automata
Sort
View
DATESO
2004
100views Database» more  DATESO 2004»
13 years 9 months ago
Storage and Retrieval of First Order Logic Terms in a Database
In this paper we present a storage method for sets of first order logic terms in a relational database using function symbols based indexing method of Discrimination trees. This is...
Peter Gurský
TCS
2008
13 years 7 months ago
Fine hierarchies and m-reducibilities in theoretical computer science
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
Victor L. Selivanov
RECOMB
2005
Springer
14 years 7 months ago
Information Theoretic Approaches to Whole Genome Phylogenies
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
David Burstein, Igor Ulitsky, Tamir Tuller, Benny ...
IWSOS
2009
Springer
14 years 2 months ago
Self-organized Evacuation Based on LifeBelt
Abstract. In this paper, we have investigated the feasibility of a selforganized evacuation process when compared with a centralized control. The evacuation strategy is based on â€...
Kashif Zia, Alois Ferscha
FOSSACS
2007
Springer
14 years 1 months ago
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
Matthew Hague, C.-H. Luke Ong