Challenges of source selection in the WoD - Zurich Open Repository ...
... accessing the sources' data. To address this shortcoming, federated join- cardinality approximation ... results-yielding) ones. In this paper, we analyze the usefulness of cardinality approximation for source ... - cardinality approximation techniques have been proposed to narrow down the number of possible allocations to a ... few most promising (or results-yielding) ones. In this paper, we analyze the usefulness of cardinality ...
Linear spanning sets for matrix spaces - Zurich Open Repository and...
... cardinality of subsets of $\mathbb{F}[\mathit{A}]\mathit{S} \mathbb{F}[\mathit{B}]$ when $\mathbb{F}$ is a ... matrix space. This result is then used to determine the cardinality of subsets of $\mathbb{F}[\mathit{A ... $\mathbb{F}$ is equal to the whole matrix space. This result is then used to determine the cardinality of ... matrix space. This result is then used to determine the cardinality of subsets of $\mathbb{F}[\mathit{A ...
Cyclic orbit codes - Zurich Open Repository and Archive
... utilized to compute the minimum distance and cardinality of a given code and propose different decoding ... cardinality of a given code and propose different decoding procedures for a particular subclass of cyclic ... codes can be utilized to compute the minimum distance and cardinality of a given code and propose ... distance and cardinality of a given code and propose different decoding procedures for a particular ...
Similarity of chemotherapy histories based on imputed values - Zuri...
... events to achieve similar cardinality, and dynamic time warping, a widely-used technique in the ... achieve similar cardinality, and dynamic time warping, a widely-used technique in the comparison of time ... events to achieve similar cardinality, and dynamic time warping, a widely-used technique in the ... achieve similar cardinality, and dynamic time warping, a widely-used technique in the comparison of time ...
A complete characterization of irreducible cyclic orbit codes and t...
... show how some of the basic properties of these codes, the cardinality and the minimum distance, can be ... basic properties of these codes, the cardinality and the minimum distance, can be derived using the ... properties of these codes, the cardinality and the minimum distance, can be derived using the isomorphism of ... of these codes, the cardinality and the minimum distance, can be derived using the isomorphism of the ...
Prof. Dr. Bernd Gärtner
... cardinality of $\R$ is maximum for the given VC-dimension. In general, such range spaces are called {\em ... spaces are called {\em pseudogeometric}, and they have the property that the cardinality of $\R$ is ...
Constructions of constant dimension codes - Zurich Open Repository ...
... cardinality and efficient decoding algorithm for all parameters. This article provides a survey on ... of codes with large cardinality and efficient decoding algorithm for all parameters. This article ... the Grassmannian. It is desirable to have constructions of codes with large cardinality and efficient ... cardinality and efficient decoding algorithm for all parameters. This article provides a survey on ...
https://www.mins.ee.ethz.ch/teaching/MoI/handouts/exam_21-22.pdf
... by B(x,m) := {y ∈ Hn | d(x, y) ≤ m}. Compute the cardinality of the ball B(x,m). (c) (6 points) Fix m ... ) is the cardinality of the smallest m-covering. Prove that N(m;Hn, d) ≥ 2 n∑m k=0 ( n k ) . (d) (4 ... by B(x,m) := {y ∈ Hn | d(x, y) ≤ m}. Compute the cardinality of the ball B(x,m). (c) (6 points) Fix m ... ) is the cardinality of the smallest m-covering. Prove that N(m;Hn, d) ≥ 2 n∑m k=0 ( n k ) . (d) (4 ...
Success for DDIS at ISWC 2017
... argues for a renewed effort to find novel join- cardinality approximation techniques for source selection ... - cardinality approximation techniques for source selection or a change of paradigm in query execution to ...
http://files.ifi.uzh.ch/boehlen/Papers/ABJLS02.pdf
... . The first set of experiments (high cardinality) use the Customer.Name attribute, which has 100,000 ... unique values partitioned among eight sites. The second set of experiments (low cardinality) uses ... . The first set of experiments (high cardinality) use the Customer.Name attribute, which has 100,000 ... unique values partitioned among eight sites. The second set of experiments (low cardinality) uses ...
