Sciweavers

680 search results - page 35 / 136
» Complexity of Strict Implication
Sort
View
ADBIS
2004
Springer
367views Database» more  ADBIS 2004»
15 years 7 months ago
Logical Design of Generalizations in Object-relational Databases
The richer data models of object relational databases opens many more options for the logical design of a database schema increasing the complexity of logical database design enorm...
Johann Eder, Simone Kanzian
SG
2010
Springer
15 years 7 months ago
Self Portraits with Mandelbrot Genetics
This paper is an artist statement describing a manipulation of the Mandelbrot Set equation as the basis for creating semi-figurative images, using a genetic algorithm. Modernist pa...
Jeffrey Ventrella
ICFCA
2010
Springer
15 years 8 months ago
Hardness of Enumerating Pseudo-intents in the Lectic Order
We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents det...
Felix Distel
ICC
2007
IEEE
116views Communications» more  ICC 2007»
15 years 8 months ago
A Simple Iterative Gaussian Detector for Severely Delay-Spread MIMO Channels
— In this paper, a low-complexity high-performance detection algorithm for multiple input multiple output (MIMO) channels with severe delay spread is proposed. This algorithm per...
Tianbin Wo, Peter Adam Hoeher
ILC
2007
Springer
15 years 8 months ago
A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata
Two-way alternating automata were introduced by Vardi in order to study the satisfiability problem for the modal µ-calculus extended with backwards modalities. In this paper, we ...
Jacques Duparc, Alessandro Facchini