Results 61 to 70 of about 477 (109)
Unveiling the binary nature of NGC 2323 [PDF]
Astronomy & AstrophysicsWe studied the binary structure nature of NGC 2323 with Gaia Data Release 3 (DR3). We discovered the binary structure of NGC 2323 by the HDBSCAN algorithm based on the astrometric and photometric data from Gaia DR3. Then we employed the PETAR N-body code
Songmei Qin +11 more
semanticscholar +1 more source
Concentration Properties of Extremal Parameters in Random Discrete Structures [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 The purpose of this survey is to present recent results concerning concentration properties of extremal parameters of random discrete structures. A main emphasis is placed on the height and maximum degree of several kinds of random trees. We also provide
Michael Drmota
doaj +1 more source
Randomized Optimization: a Probabilistic Analysis [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 In 1999, Chan proposed an algorithm to solve a given optimization problem: express the solution as the minimum of the solutions of several subproblems and apply the classical randomized algorithm for finding the minimum of $r$ numbers.
Jean Cardinal +2 more
doaj +1 more source
A coupon collector's problem with bonuses [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 In this article, we study a variant of the coupon collector's problem introducing a notion of a \emphbonus. Suppose that there are c different types of coupons made up of bonus coupons and ordinary coupons, and that a collector gets every coupon with ...
Toshio Nakata, Izumi Kubo
doaj +1 more source
Bipartite Random Graphs and Cuckoo Hashing [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 The aim of this paper is to extend the analysis of Cuckoo Hashing of Devroye and Morin in 2003. In particular we make several asymptotic results much more precise.
Reinhard Kutzelnigg
doaj +1 more source
Security and Communication Networks, 2023 Security and Communication Networks
semanticscholar +1 more source
Stokes polyhedra for $X$-shaped polyminos [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Consider a pair of $\textit{interlacing regular convex polygons}$, each with $2(n + 2)$ vertices, which we will be referring to as $\textit{red}$ and $\textit{black}$ ones.
Yu. Baryshnikov +3 more
doaj +1 more source
On Greedy Trie Execution [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 In the paper "How to select a looser'' Prodinger was analyzing an algorithm where $n$ participants are selecting a leader by flipping fair coins, where recursively, the 0-party (those who i.e. have tossed heads) continues until the leader is chosen.
Zbigniew Gołębiewski, Filip Zagórski
doaj +1 more source
Average depth in a binary search tree with repeated keys [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 Random sequences from alphabet $\{1, \ldots,r\}$ are examined where repeated letters are allowed. Binary search trees are formed from these, and the average left-going depth of the first $1$ is found.
Margaret Archibald, Julien Clément
doaj +1 more source
, 2012 The processing of data acquired by the CMS detector at LHC is carried out with an object-oriented C++ software framework: CMSSW. With the increasing luminosity delivered by the LHC, the treatment of recorded data requires extraordinary large computing ...
T. Hauth, V. I. and, D. Piparo
semanticscholar +1 more source