Sciweavers

845 search results - page 83 / 169
» Connecting Many-Sorted Theories
Sort
View
ICDE
1994
IEEE
103views Database» more  ICDE 1994»
15 years 10 months ago
A Multi-Set Extended Relational Algebra - A Formal Approach to a Practical Issue
The relational data model is based on sets of tuples, i.e. it does not allow duplicate tuples in a relation. Many database languages and systems do require multi-set place, the hi...
Paul W. P. J. Grefen, Rolf A. de By
ATAL
2008
Springer
15 years 8 months ago
Complexity of terminating preference elicitation
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
Toby Walsh
COMPGEOM
2004
ACM
15 years 11 months ago
The number of lines tangent to arbitrary convex polyhedra in 3D
We prove that the lines tangent to four possibly intersecting convex polyhedra in   3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
Hervé Brönnimann, Olivier Devillers, V...
DAC
2010
ACM
15 years 10 months ago
Lattice-based computation of Boolean functions
This paper studies the implementation of Boolean functions with lattices of two-dimensional switches. Each switch is controlled by a Boolean literal. If the literal is 1, the swit...
Mustafa Altun, Marc D. Riedel
IJON
2008
156views more  IJON 2008»
15 years 6 months ago
Analysis of the dynamical behavior of a feedback auto-associative memory
The dynamical behavior and the stability properties of fixed points in a feedback auto-associative memory are investigated. The proposed structure encompasses a multi-layer percep...
Mahmood Amiri, Sohrab Saeb, Mohammad Javad Yazdanp...