1302 search results - page 15 / 261 » Fair Equivalence Relations |
COMBINATORICS
2006
14 years 9 months ago
2006
Let Sn be the group of permutations of [n] = {1, . . . , n}. The Bruhat order on Sn is a partial order relation, for which there are several equivalent definitions. Three well-kno...
ACL
2006
14 years 10 months ago
2006
This paper describes a study of the patterns of translational equivalence exhibited by a variety of bitexts. The study found that the complexity of these patterns in every bitext ...
MEMOCODE
2008
IEEE
15 years 3 months ago
2008
IEEE
Equivalence checking is a classical verification method determining if a finite-state concurrent system (protocol) satisfies its desired external behaviour (service) by compari...
163
click to vote
PODS
2009
ACM
15 years 10 months ago
2009
ACM
We consider the problem of deciding query equivalence for a conjunctive language in which queries output complex objects composed from a mixture of nested, unordered collection ty...
43
Voted
ENTCS
2007
14 years 9 months ago
2007
We provide a new look at formal aspects of component substitutability (replacement of a component with a new one) and independent implementability (reuse of a component in any sys...