Results 31 to 40 of about 939,183 (156)
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
Vertex-Unfoldings of Simplicial Polyhedra [PDF]
, 2001 We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have a disconnected
Demaine, Erik D. +4 more
core +5 more sources
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
Experimental and Computational Multiphase Flow, 2023 This study focuses on the transport, deposition, and triggered immune response of intranasal vaccine droplets to the angiotensin-converting-enzyme-2-rich region, i.e., the olfactory region (OR), in the nasal cavity of a 6-year-old female to possibly ...
Hamideh Hayati +4 more
semanticscholar +1 more source
Well-Centered Triangulation [PDF]
, 2008 Meshes composed of well-centered simplices have nice orthogonal dual meshes (the dual Voronoi diagram). This is useful for certain numerical algorithms that prefer such primal-dual mesh pairs.
Guoy, Damrong +3 more
core +3 more sources
HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 This extended abstract describes and analyses a near-optimal probabilistic algorithm, HYPERLOGLOG, dedicated to estimating the number of \emphdistinct elements (the cardinality) of very large data ensembles.
Philippe Flajolet +3 more
doaj +1 more source
Polygonal Chains Cannot Lock in 4D [PDF]
, 2001 We prove that, in all dimensions d>=4, every simple open polygonal chain and every tree may be straightened, and every simple closed polygonal chain may be convexified.
Cocan, Roxana, O'Rourke, Joseph
core +4 more sources
Tail Bounds for the Wiener Index of Random Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Upper and lower bounds for the tail probabilities of the Wiener index of random binary search trees are given. For upper bounds the moment generating function of the vector of Wiener index and internal path length is estimated.
Tämur Ali Khan, Ralph Neininger
doaj +1 more source
2048 Without New Tiles Is Still Hard [PDF]
, 2016 We study the computational complexity of a variant of the popular 2048 game in which no new tiles are generated after each move. As usual, instances are defined on rectangular boards of arbitrary size.
Abdelkader, Ahmed +2 more
core +1 more source
A Note on the Approximation of Perpetuities [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 We propose and analyze an algorithm to approximate distribution functions and densities of perpetuities. Our algorithm refines an earlier approach based on iterating discretized versions of the fixed point equation that defines the perpetuity.
Margarete Knape, Ralph Neininger
doaj +1 more source