Sciweavers

1679 search results - page 34 / 336
» Strong order equivalence
Sort
View
ICDT
1997
ACM
89views Database» more  ICDT 1997»
14 years 2 months ago
On Topological Elementary Equivalence of Spatial Databases
We consider spatial databases and queries definable using first-order logic and real polynomial inequalities. We are interested in topological queries: queries whose result only ...
Bart Kuijpers, Jan Paredaens, Jan Van den Bussche
ACL
2006
13 years 11 months ago
Empirical Lower Bounds on the Complexity of Translational Equivalence
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 ...
Benjamin Wellington, Sonjia Waxmonsky, I. Dan Mela...
GRC
2007
IEEE
14 years 4 months ago
Granulation with Indistinguishability, Equivalence, or Similarity
Abstract— One of the relations used with granularity is indistinguishability, where distinguishable entities in a finer-grained granule are indistinguishable in a coarser-graine...
C. Maria Keet
DAC
2006
ACM
14 years 3 months ago
Mining global constraints for improving bounded sequential equivalence checking
In this paper, we propose a novel technique on mining relationships in a sequential circuit to discover global constraints. In contrast to the traditional learning methods, our mi...
Weixin Wu, Michael S. Hsiao
ICECCS
2000
IEEE
135views Hardware» more  ICECCS 2000»
14 years 2 months ago
Definitions of Equivalence for Transformational Synthesis of Embedded Systems
Design of embedded systems is a complex task that requires design cycles founded upon formal notation, so that the synthesis from specification to implementation can be carried ou...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...