Results 41 to 50 of about 818,608 (269)
Link Evolution: Analysis and Algorithms [PDF]
Internet Mathematics, 2004 The main purpose of this interesting paper is to point out the increasing importance of the evolutionary computing approach to the future web search algorithms and information retrieval techniques. As a specific aim, this article presents an efficient algorithm that computes incrementally good approximations to Google's PageRank [S. Brin, L. Page (1998)
Chien, Steve +4 more
openaire +2 more sources
Analysis of concurrent algorithms
DAIMI Report Series, 1981 Analyzing the running time of a concurrent algorithm can be as important as verifying its partial correctness or termination. A simple technique for analyzing the running time of a concurrent algorithm is presented. To analyze an algorithm with concurrent processes, the interaction between the processes must be considered.
openaire +2 more sources
Bayesianism: An Algorithmic Analysis
Information and Computation, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
The location of the first maximum in the first sojourn of a Dyck path [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Analysis of ...
Helmut Prodinger
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background An earlier study on children diagnosed with acute lymphoblastic leukemia (ALL) at Moi Teaching and Referral Hospital (MTRH) in Kenya reported a low event‐free survival (EFS), excess treatment abandonment, and high induction mortality.
Gilbert Olbara +7 more
wiley +1 more source
Tropical Vertex-Disjoint Cycles of a Vertex-Colored Digraph: Barter Exchange with Multiple Items Per Agent [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 In a barter exchange market, agents bring items and seek to exchange their items with one another. Agents may agree to a k-way exchange involving a cycle of k agents.
Timothy Highley, Hoang Le
doaj +1 more source
Algorithmic Randomness and Fourier Analysis [PDF]
Theory of Computing Systems, 2018 Suppose $1 < p < \infty$. Carleson's Theorem states that the Fourier series of any function in $L^p[-π, π]$ converges almost everywhere. We show that the Schnorr random points are precisely those that satisfy this theorem for every $f \in L^p[-π, π]$ given natural computability conditions on $f$ and $p$.
Johanna N. Y. Franklin +2 more
openaire +3 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT As part of the European Cooperative Study Group for Paediatric Rare Tumours initiative, we developed standard clinical practice guidelines for ovarian sex cord stromal tumors, based on comprehensive national and international cohort analyses, literature review, and a final expert consensus conference.
Dominik T. Schneider +15 more
wiley +1 more source
Tight Euler tours in uniform hypergraphs - computational aspects [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 By a tight tour in a $k$-uniform hypergraph $H$ we mean any sequence of its vertices $(w_0,w_1,\ldots,w_{s-1})$ such that for all $i=0,\ldots,s-1$ the set $e_i=\{w_i,w_{i+1}\ldots,w_{i+k-1}\}$ is an edge of $H$ (where operations on indices are computed ...
Zbigniew Lonc +2 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Pediatric supportive care clinical trials often involve multiple clinically important outcomes, complicating trial interpretation. Hierarchical composite endpoints (HCEs) provide a framework to integrate key outcomes according to clinical importance.
Willem H. Collier +11 more
wiley +1 more source