Relevant bibliographies by topics / Estimateurs de cardinalité

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Estimateurs de cardinalité'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Estimateurs de cardinalité.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Estimateurs de cardinalité"

1

Kalachev, G. V. "Generalization of Cardinality Estimates for Plane Circuits Realizing Partial Boolean Operators." Moscow University Mathematics Bulletin 73, no. 3 (2018): 120–23. http://dx.doi.org/10.3103/s0027132218030075.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bozkus, Cem, and Basilio B. Fraguela. "Accelerating the HyperLogLog Cardinality Estimation Algorithm." Scientific Programming 2017 (2017): 1–8. http://dx.doi.org/10.1155/2017/2040865.

Full text
Abstract:
In recent years, vast amounts of data of different kinds, from pictures and videos from our cameras to software logs from sensor networks and Internet routers operating day and night, are being generated. This has led to new big data problems, which require new algorithms to handle these large volumes of data and as a result are very computationally demanding because of the volumes to process. In this paper, we parallelize one of these new algorithms, namely, the HyperLogLog algorithm, which estimates the number of different items in a large data set with minimal memory usage, as it lowers the
APA, Harvard, Vancouver, ISO, and other styles
3

Li, Shijie, and Humin Lei. "Measurement-Driven Multi-Target Multi-Bernoulli Filter." Mathematical Problems in Engineering 2018 (July 22, 2018): 1–9. http://dx.doi.org/10.1155/2018/6515608.

Full text
Abstract:
A measurement-driven multi-target multi-Bernoulli (MeMBer) filter which modifies the MeMBer filter by the measurements information is proposed in this paper. The proposed filter refines both the legacy estimates and the data-induced estimates of the MeMBer filter. For the targets under the legacy track set, the detection probabilities derived from the measurements are employed to refine the multi-target distribution. And for the targets under the data-induced track set, the multi-target distribution is further improved by the modified existence probabilities of the legacy tracks. Unlike the ca
APA, Harvard, Vancouver, ISO, and other styles
4

Harrison, R. Wes, Jeffrey Gillespie, and Deacue Fields. "Analysis of Cardinal and Ordinal Assumptions in Conjoint Analysis." Agricultural and Resource Economics Review 34, no. 2 (2005): 238–52. http://dx.doi.org/10.1017/s106828050000839x.

Full text
Abstract:
Of twenty-three agricultural economics conjoint analyses conducted between 1990 and 2001, seventeen used interval-rating scales, with estimation procedures varying widely. This study tests cardinality assumptions in conjoint analysis when interval-rating scales are used, and tests whether the ordered probit or two-limit tobit model is the most valid. Results indicate that cardinality assumptions are invalid, but estimates of the underlying utility scale for the two models do not differ. Thus, while the ordered probit model is theoretically more appealing, the two-limit tobit model may be more
APA, Harvard, Vancouver, ISO, and other styles
5

Franz, Astrid. "Hausdorff dimension estimates for non-injective maps using the cardinality of the pre-image sets." Nonlinearity 13, no. 5 (2000): 1425–38. http://dx.doi.org/10.1088/0951-7715/13/5/301.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Danchev, Peter. "The number of idempotents in abelian group rings." Filomat 26, no. 4 (2012): 719–23. http://dx.doi.org/10.2298/fil1204719d.

Full text
Abstract:
Suppose that R is a commutative unitary ring of arbitrary characteristic and G is a multiplicative abelian group. Our main theorem completely determines the cardinality of the set id(RG), consisting of all idempotent elements in the group ring RG. It is explicitly calculated only in terms associated with R, G and their divisions. This result strengthens previous estimates obtained in the literature recently.
APA, Harvard, Vancouver, ISO, and other styles
7

XI, PING, and YUAN YI. "GENERALIZED D. H. LEHMER PROBLEM OVER SHORT INTERVALS." Glasgow Mathematical Journal 53, no. 2 (2010): 293–99. http://dx.doi.org/10.1017/s0017089510000704.

Full text
Abstract:
AbstractLet n ≥ 2 be a fixed positive integer, q ≥ 3 and c, ℓ be integers with (nc, q)=1 and ℓ|n. Suppose and consist of consecutive integers which are coprime to q. We define the cardinality of a set: The main purpose of this paper is to use the estimates of Gauss sums and Kloosterman sums to study the asymptotic properties of N(, , c, n, ℓ; q), and to give an interesting asymptotic formula for it.
APA, Harvard, Vancouver, ISO, and other styles
8

PETRIDIS, GIORGIS. "Plünnecke's Inequality." Combinatorics, Probability and Computing 20, no. 6 (2011): 921–38. http://dx.doi.org/10.1017/s096354831100037x.

Full text
Abstract:
Plünnecke's inequality is a standard tool for obtaining estimates on the cardinality of sumsets and has many applications in additive combinatorics. We present a new proof. The main novelty is that the proof is completed with no reference to Menger's theorem or Cartesian products of graphs. We also investigate the sharpness of the inequality and show that it can be sharp for arbitrarily long, but not for infinite commutative graphs. A key step in our investigation is the construction of arbitrarily long regular commutative graphs. Lastly we prove a necessary condition for the inequality to be
APA, Harvard, Vancouver, ISO, and other styles
9

Chen, Xiaohong, David T. Jacho-Chávez, and Oliver Linton. "AVERAGING OF AN INCREASING NUMBER OF MOMENT CONDITION ESTIMATORS." Econometric Theory 32, no. 1 (2014): 30–70. http://dx.doi.org/10.1017/s0266466614000851.

Full text
Abstract:
We establish the consistency and asymptotic normality for a class of estimators that are linear combinations of a set of$\sqrt n$-consistent nonlinear estimators whose cardinality increases with sample size. The method can be compared with the usual approaches of combining the moment conditions (GMM) and combining the instruments (IV), and achieves similar objectives of aggregating the available information. One advantage of aggregating the estimators rather than the moment conditions is that it yields robustness to certain types of parameter heterogeneity in the sense that it delivers consist
APA, Harvard, Vancouver, ISO, and other styles
10

HUANG, HAO, JIE MA, ASAF SHAPIRA, BENNY SUDAKOV, and RAPHAEL YUSTER. "Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs." Combinatorics, Probability and Computing 22, no. 6 (2013): 859–73. http://dx.doi.org/10.1017/s0963548313000394.

Full text
Abstract:
A minimum feedback arc set of a directed graph G is a smallest set of arcs whose removal makes G acyclic. Its cardinality is denoted by β(G). We show that a simple Eulerian digraph with n vertices and m arcs has β(G) ≥ m2/2n2+m/2n, and this bound is optimal for infinitely many m, n. Using this result we prove that a simple Eulerian digraph contains a cycle of length at most 6n2/m, and has an Eulerian subgraph with minimum degree at least m2/24n3. Both estimates are tight up to a constant factor. Finally, motivated by a conjecture of Bollobás and Scott, we also show how to find long cycles in E
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Estimateurs de cardinalité"

1

Giroire, Frédéric. "Réseaux, algorithmique et analyse combinatoire de grands ensembles." Paris 6, 2006. http://www.theses.fr/2006PA066530.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Barksten, Martin. "Evaluating the effect of cardinality estimates on two state-of-the-art query optimizer's selection of access method." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-189892.

Full text
Abstract:
This master thesis concern relational databases and their query optimizer’s sensitivity to cardinality estimates and the e!ect the quality of the estimate has on the number of different access methods used for the same relation. Two databases are evaluated — PostgreSQL and MariaDB — on a real-world dataset to provide realistic results. The evaluation was done via a tool implemented in Clojure and tests were conducted on a query and subsets of it with varying sample sizes used when estimating cardinality. The results indicate that MariaDB’s query optimizer is less sensitive to cardinality estim
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Estimateurs de cardinalité"

1

Khachatryan, Andranik, and Klemens Böhm. "Accurate Cost Estimation Using Distribution-Based Cardinality Estimates for Multi-dimensional Queries." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22351-8_46.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Du Nguyen, Van, Hai Bang Truong, and Ngoc Thanh Nguyen. "Towards Analyzing the Impact of Diversity and Cardinality on the Quality of Collective Prediction Using Interval Estimates." In Lecture Notes in Computer Science. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-22999-3_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Vidyasagar, M. "Markov Processes." In Hidden Markov Processes. Princeton University Press, 2014. http://dx.doi.org/10.23943/princeton/9780691133157.003.0004.

Full text
Abstract:
This chapter deals with Markov processes. It first defines the “Markov property” and shows that all the relevant information about a Markov process assuming values in a finite set of cardinality n can be captured by a nonnegative n x n matrix known as the state transition matrix, and an n-dimensional probability distribution of the initial state. It then invokes the results of the previous chapter on nonnegative matrices to analyze the temporal evolution of Markov processes. It also estimates the state transition matrix and considers the dynamics of stationary Markov chains, recurrent and transient states, hitting probability and mean hitting times, and the ergodicity of Markov chains.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Estimateurs de cardinalité"

1

Cai, Walter. "Tighter Upper Bounds for Join Cardinality Estimates." In SIGMOD/PODS '18: International Conference on Management of Data. ACM, 2018. http://dx.doi.org/10.1145/3183713.3183714.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gufler, Benjamin, Nikolaus Augsten, Angelika Reiser, and Alfons Kemper. "Load Balancing in MapReduce Based on Scalable Cardinality Estimates." In 2012 IEEE International Conference on Data Engineering (ICDE 2012). IEEE, 2012. http://dx.doi.org/10.1109/icde.2012.58.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography