Sciweavers

10048 search results - page 228 / 2010
» The Structure and Performance of Interpreters
Sort
View
MDAI
2009
Springer
15 years 11 months ago
Comparison of Data Structures for Computing Formal Concepts
Presented is preliminary study of the role of data structures in algorithms for formal concept analysis. Studied is performance of selected algorithms in dependence on chosen data ...
Petr Krajca, Vilém Vychodil
ESA
2004
Springer
106views Algorithms» more  ESA 2004»
15 years 11 months ago
Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects
The ability to represent and query continuously moving objects is important in many applications of spatio-temporal database systems. In this paper we develop data structures for ...
Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Y...
EDBT
2006
ACM
102views Database» more  EDBT 2006»
16 years 7 months ago
STRIDER: A Versatile System for Structural Disambiguation
We present STRIDER1 , a versatile system for the disambiguation of structure-based information like XML schemas, structures of XML documents and web directories. The system perform...
Federica Mandreoli, Riccardo Martoglia, Enrico Ron...
ICALP
1998
Springer
15 years 11 months ago
Constraint Automata and the Complexity of Recursive Subtype Entailment
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
Fritz Henglein, Jakob Rehof
CORR
2007
Springer
162views Education» more  CORR 2007»
15 years 7 months ago
Order-Invariant MSO is Stronger than Counting MSO in the Finite
We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), ex...
Tobias Ganzow, Sasha Rubin