Sciweavers

384 search results - page 9 / 77
» Equivalence Relations on Classes of Computable Structures
Sort
View
ICTAC
2005
Springer
14 years 1 months ago
Covarieties of Coalgebras: Comonads and Coequations
Coalgebras provide effective models of data structures and state-transition systems. A virtual covariety is a class of coalgebras closed under coproducts, images of coalgebraic mo...
Ranald Clouston, Robert Goldblatt
JACM
2000
81views more  JACM 2000»
13 years 7 months ago
Relational queries over interpreted structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
IJCAI
2007
13 years 9 months ago
r-grams: Relational Grams
We introduce relational grams (r-grams). They upgrade n-grams for modeling relational sequences of atoms. As n-grams, r-grams are based on smoothed n-th order Markov chains. Smoot...
Niels Landwehr, Luc De Raedt
STOC
2003
ACM
136views Algorithms» more  STOC 2003»
14 years 8 months ago
Alpha-shapes and flow shapes are homotopy equivalent
In this paper we establish a topological similarity between two apparently different shape constructors from a set of points. Shape constructors are geometric structures that tran...
Tamal K. Dey, Joachim Giesen, Matthias John
ISMIS
2005
Springer
14 years 1 months ago
Subsystem Based Generalizations of Rough Set Approximations
Abstract. Subsystem based generalizations of rough set approximations are investigated. Instead of using an equivalence relation, an arbitrary binary relation is used to construct ...
Yiyu Yao, Yaohua Chen