Sciweavers

2286 search results - page 83 / 458
» Algorithms for Categorical Equivalence
Sort
View
ADC
2006
Springer
128views Database» more  ADC 2006»
15 years 3 months ago
Horn clauses and functional dependencies in complex-value databases
We extend Fagin’s result on the equivalence between functional dependencies in relational databases and propositional Horn clauses. It is shown that this equivalence still holds...
Sven Hartmann, Sebastian Link
PDPTA
2007
14 years 11 months ago
Scheduling Divisible Workloads from Multiple Sources in Linear Daisy Chain Networks
— This paper considers scheduling divisible workloads from multiple sources in linear networks of processors. We propose a two phase scheduling strategy (TPSS) to minimize the ov...
Xinxin Liu, Han Zhao, Xiaolin Li
COLING
1992
14 years 11 months ago
Term-Rewriting As A Basis For A Uniform Architecture In Machine Translation
In machine translation (MT) dierent levels of representation can be used to translate a source language sentence onto its target language equivalent. These levels have to be relat...
Wilhelm Weisweber
TCS
2008
14 years 9 months ago
Digraph measures: Kelly decompositions, games, and orderings
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
Paul Hunter, Stephan Kreutzer
IPL
2000
95views more  IPL 2000»
14 years 9 months ago
An efficient upper bound of the rotation distance of binary trees
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons ...
Jean Marcel Pallo