3172 search results - page 245 / 635 » On the Random-Self-Reducibility of Complete Sets |
190
click to vote
STACS
1991
Springer
15 years 10 months ago
1991
Springer
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
185
click to vote
DLOG
1998
15 years 8 months ago
1998
This paper introduces YAYA1, a Description Logic system focused towards learning complex interrelations among objects. YAYA Concept Language (YCL) is quite restricted; although it...
176
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The ov...
137
click to vote
IPL
2008
15 years 6 months ago
2008
This paper studies the equational theory of prebisimilarity, a bisimulation-based preorder introduced by Hennessy and Milner in the early 1980s, over basic CCS with the divergent ...
194
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...