Sciweavers

513 search results - page 40 / 103
» Finitely Based, Finite Sets of Words
Sort
View
PODS
2010
ACM
223views Database» more  PODS 2010»
15 years 1 months ago
Characterizing schema mappings via data examples
Schema mappings are high-level specifications that describe the relationship between two database schemas; they are considered to be the essential building blocks in data exchange...
Bogdan Alexe, Phokion G. Kolaitis, Wang Chiew Tan
CORR
2010
Springer
144views Education» more  CORR 2010»
14 years 12 months ago
Algorithmic Verification of Single-Pass List Processing Programs
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
Rajeev Alur, Pavol Cerný
SIAMJO
2000
113views more  SIAMJO 2000»
14 years 11 months ago
Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic inequalities. We propose two methods, one based on successi...
Masakazu Kojima, Levent Tunçel
EH
2000
IEEE
81views Hardware» more  EH 2000»
15 years 4 months ago
Toward Self-Repairing and Self-Replicating Hardware: The Embryonics Approach
The growth and operation of all living beings are directed by the interpretation, in each of their cells, of a chemical program, the DNA string or genome. This process is the sour...
Daniel Mange, Moshe Sipper, André Stauffer,...
EUSFLAT
2001
15 years 1 months ago
The Frank t-norm family in fuzzy similarity measurement
A family of fuzzification schemes is proposed that can be used to transform cardinality-based similarity measures for ordinary sets into similarity measures for fuzzy sets in a fi...
Bernard De Baets, Hans De Meyer