90 search results - page 12 / 18 » Perfect Sorting by Reversals |
JMLR
2002
13 years 7 months ago
2002
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...
ASE
2007
13 years 8 months ago
2007
Knowing which associations are compositions is important in a tool for the reverse engineering of UML class diagrams. Firstly, recovery of composition relationships bridges the ga...
DAGSTUHL
2006
13 years 9 months ago
2006
In this report paper we collect recent results on the vertex reconstruction in Cayley graphs Cay(G, S). The problem is stated as the problem of reconstructing a vertex from the mi...
IDEAS
2000
IEEE
14 years 7 days ago
2000
IEEE
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
CONCURRENCY
2007
13 years 7 months ago
2007
We here present and evaluate relative accounting, an autonomous accounting scheme that provides accurate results even when the parties (consumer and provider) do not trust each ot...