Filters








91 Hits in 4.3 sec

Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise [chapter]

Bodo Manthey, Till Tantau
<i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort.  ...  An analysis of the smoothed tree height subject to n and d lies at the heart of our paper: We prove that the smoothed height of binary search trees is Θ( n/d + log n), where d ≥ 1/n may depend on n.  ...  Acknowledgements We thank Heiko Röglin and Christian Sohler for helpful discussions and comments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-85238-4_38">doi:10.1007/978-3-540-85238-4_38</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/eql5lgmgp5hfhivwplwnfw67ea">fatcat:eql5lgmgp5hfhivwplwnfw67ea</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706082159/https://eccc.weizmann.ac.il/report/2007/039/revision/1/download/" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7b/a1/7ba1889876b80eb6ebaa6b0394ef65aae00fcd9d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-85238-4_38"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

On Smoothed Analysis of Quicksort and Hoare's Find [chapter]

Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi
<span title="">2009</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We provide a smoothed analysis of Hoare's find algorithm and we revisit the smoothed analysis of quicksort.  ...  We analyze what happens between these two extremes by providing a smoothed analysis of the algorithm in terms of two different perturbation models: additive noise and partial permutations.  ...  [1] also analyzed quicksort, for which they proved an upper bound of O n p log n . New Results We give a smoothed analysis of Hoare's find under additive noise.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-02882-3_17">doi:10.1007/978-3-642-02882-3_17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2xkl2nkdyvaqnb6choq25cmeja">fatcat:2xkl2nkdyvaqnb6choq25cmeja</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809051613/http://wwwhome.math.utwente.nl/~mantheyb/conferences/COCOON2009_FouzEA_Hoare.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/57/3e/573e5e170139d0a44b758ff7a0d03a126961a2a8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-02882-3_17"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

On Smoothed Analysis of Quicksort and Hoare's Find

Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi
<span title="2011-01-26">2011</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qhi3z76be5c5xeihac5cyiid3m" style="color: black;">Algorithmica</a> </i> &nbsp;
We provide a smoothed analysis of Hoare's find algorithm and we revisit the smoothed analysis of quicksort.  ...  We analyze what happens between these two extremes by providing a smoothed analysis of the algorithm in terms of two different perturbation models: additive noise and partial permutations.  ...  [1] also analyzed quicksort, for which they proved an upper bound of O n p log n . New Results We give a smoothed analysis of Hoare's find under additive noise.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00453-011-9490-9">doi:10.1007/s00453-011-9490-9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hxbm3ibofbah7lanvkbq65euui">fatcat:hxbm3ibofbah7lanvkbq65euui</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809051613/http://wwwhome.math.utwente.nl/~mantheyb/conferences/COCOON2009_FouzEA_Hoare.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/57/3e/573e5e170139d0a44b758ff7a0d03a126961a2a8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00453-011-9490-9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Smoothed analysis of left-to-right maxima with applications

Valentina Damerow, Bodo Manthey, Friedhelm Meyer Auf Der Heide, Harald Räcke, Christian Scheideler, Christian Sohler, Till Tantau
<span title="2012-07-01">2012</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xjsyokeq6nawdowtypazhyoyli" style="color: black;">ACM Transactions on Algorithms</a> </i> &nbsp;
binary search trees and the smoothed number of comparisons in the quicksort algorithm and prove bounds of Θ n/ + log n and Θ n +1 n/ + n log n , respectively, for uniform random noise from the interval  ...  In this paper we present a smoothed analysis of the number of left-to-right maxima in the presence of additive random noise.  ...  We applied the result for uniform noise to the analysis of the smoothed height of binary search trees and the smoothed number of comparisons made by the quicksort algorithm under additive noise.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2229163.2229174">doi:10.1145/2229163.2229174</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zwlqrs5hynd2dd33sw7emvxrry">fatcat:zwlqrs5hynd2dd33sw7emvxrry</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130409143113/http://www.cs.uni-paderborn.de/fileadmin/Informatik/FG-TI/Publikationen/ltrm.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e5/a5/e5a5fc5d0643e8b974f8488b635a2e69a79fe595.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2229163.2229174"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

On Smoothed Analysis of Quicksort and Hoare's Find [article]

Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi
<span title="2009-04-25">2009</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We provide a smoothed analysis of Hoare's find algorithm and we revisit the smoothed analysis of quicksort.  ...  We analyze what happens between these two extremes by providing a smoothed analysis of the algorithm in terms of two different perturbation models: additive noise and partial permutations.  ...  The results about quicksort, scan maxima, and binary search trees are by Banderier et al. [2] and Manthey and Reischuk [11] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0904.3898v2">arXiv:0904.3898v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qgzk3qt5irgmvgdynnpqu6lvqe">fatcat:qgzk3qt5irgmvgdynnpqu6lvqe</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-0904.3898/0904.3898.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0904.3898v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Quicksort Is Optimal For Many Equal Keys [chapter]

Sebastian Wild
<span title="">2018</span> <i title="Society for Industrial and Applied Mathematics"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/orsfoxbevzfrnhxrp6ku3nxqge" style="color: black;">2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)</a> </i> &nbsp;
This resolves a conjecture by Sedgewick and Bentley (1999, 2002) and constitutes the first progress on the analysis of Quicksort with equal elements since Sedgewick's 1977 article.  ...  I prove that the average number of comparisons for median-of-k Quicksort (with fat-pivot a.k.a. three-way partitioning) is asymptotically only a constant α_k times worse than the lower bound for sorting  ...  Moreover I thank Sándor Fekete for many helpful comments that improved the presentation of the results significantly.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/1.9781611975062.2">doi:10.1137/1.9781611975062.2</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/analco/Wild18.html">dblp:conf/analco/Wild18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6uj5chzz3jgybju377ojepibzu">fatcat:6uj5chzz3jgybju377ojepibzu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191013182102/https://arxiv.org/pdf/1608.04906v3.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ae/2b/ae2b161251bae0c01befca55ea5374222d4ed725.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/1.9781611975062.2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141)

Bodo Manthey, Claire Mathieu, Heiko Röglin, Eli Upfal, Marc Herbstritt
<span title="2017-12-19">2017</span> <i title="Schloss Dagstuhl Leibniz-Zentrum für Informatik GmbH"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/u2phfyhrhje7xnnubtp3vfklcu" style="color: black;">Dagstuhl Reports</a> </i> &nbsp;
They also form the basis of frameworks like average-case and smoothed analysis, in which algorithms are analyzed beyond the classical worst-case perspective.  ...  This report documents the program and the outcomes of Dagstuhl Seminar 17141 "Probabilistic Methods in the Design and Analysis of Algorithms".  ...  Despite recent progress such as by Cooper et al. and Berenbrink et al., the coalescence time for graphs such as binary trees, d-dimensional tori, hypercubes and more generally, vertex-transitive graphs  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/dagrep.7.4.1">doi:10.4230/dagrep.7.4.1</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/journals/dagstuhl-reports/MantheyMRU17.html">dblp:journals/dagstuhl-reports/MantheyMRU17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/37g24odqhvg3rnlpudblwug6hy">fatcat:37g24odqhvg3rnlpudblwug6hy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220123034427/https://drops.dagstuhl.de/opus/volltexte/2017/7545/pdf/dagrep_v007_i004_p001_s17141.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/1c/db/1cdbffc8a894b3482885fbd743aa8c6d9769b57c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/dagrep.7.4.1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Search-Based Energy Optimization of Some Ubiquitous Algorithms

Alexander Edward Ian Brownlee, Nathan Burles, Jerry Swan
<span title="">2017</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vyxmd7qudvgfxcbr5qf4p3xl7u" style="color: black;">IEEE Transactions on Emerging Topics in Computational Intelligence</a> </i> &nbsp;
Multilayer perceptron implementations minimizing both energy and error were found, and energy reductions of up to 70% and 39.85% were obtained over the original code for Quicksort and object-oriented container  ...  Reuse This article is distributed under the terms of the Creative Commons Attribution (CC BY) licence.  ...  Data Access Statement: This work made use of several existing libraries and data sets, freely available at the locations cited.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tetci.2017.2699193">doi:10.1109/tetci.2017.2699193</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/journals/tetci/BrownleeBS17.html">dblp:journals/tetci/BrownleeBS17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4whv7w4y3nfhfl7wnbu5jwe56e">fatcat:4whv7w4y3nfhfl7wnbu5jwe56e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190426185809/http://eprints.whiterose.ac.uk/117916/1/07935484_1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2e/14/2e14c399a9c97c0d836c6a0a46ab32f270aa7e1c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tetci.2017.2699193"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

An introduction to randomized algorithms

Richard M. Karp
<span title="">1991</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/lx7dev2le5anbg6oarljwh7lie" style="color: black;">Discrete Applied Mathematics</a> </i> &nbsp;
This paper presents a wide variety of examples intended to illustrate the range of applications of randomized algorithms, and the general principles and approaches that are of greatest use in their construction  ...  The examples are drawn from many areas, including number theory, algebra, graph theory, pattern matching, selection, sorting, searching, computational geometry, combinatorial enumeration, and parallel  ...  This dual interpretation of binary search trees allows the transfer of the analysis of randomized Quicksort to yield the result that the expected insertion time or the expected time to access a random  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0166-218x(91)90086-c">doi:10.1016/0166-218x(91)90086-c</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/d3pgh36rvvhphcxov4p5yhvvhu">fatcat:d3pgh36rvvhphcxov4p5yhvvhu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811085649/http://leonidzhukov.net/hse/2011/stochmod/papers/Karp_randomized.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7d/e4/7de416fcc8528475af6d77f9c3aa808ce2219ecb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0166-218x(91)90086-c"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Breast cancer diagnosis using a multi-verse optimizer-based gradient boosting decision tree

Hamed Tabrizchi, Mohammad Tabrizchi, Hamid Tabrizchi
<span title="2020-03-24">2020</span> <i title="Springer Science and Business Media LLC"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wxtpc7l3qzds3ojx4uwv4dvlr4" style="color: black;">SN Applied Sciences</a> </i> &nbsp;
Decision Tree (GBDT).  ...  Comparing the results of GBDT-MVO model with other proposed models demonstrated that this model is more precise and has considerably lower variance in the case of a breast cancer diagnosis.  ...  In addition, quicksort algorithm has the complexity of O(m × log m) and O(m 2 ) in the best and worst case, respectively.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s42452-020-2575-9">doi:10.1007/s42452-020-2575-9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/orl4guh7orag3cit7g7khp7jzq">fatcat:orl4guh7orag3cit7g7khp7jzq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200510084339/https://link.springer.com/content/pdf/10.1007/s42452-020-2575-9.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/88/77/8877e0aaf679b909ae019f3c2cb656c7c80e6fbb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s42452-020-2575-9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> springer.com </button> </a>

Hierarchical Recursive Running Median [article]

Alexander Alekseychuk
<span title="2012-01-16">2012</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The C/C++ implementation of the algorithm is available under GPL for research purposes.  ...  algorithm for calculation of 2D and higher dimensional median filters.  ...  ACKNOWLEDGMENTS This work was done during author's engagement at the Computer Vision and Remote Sensing Group of Technische Universität Berlin.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1105.3829v3">arXiv:1105.3829v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ofxqfu53brchbfq2sr5ot5vege">fatcat:ofxqfu53brchbfq2sr5ot5vege</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1105.3829/1105.3829.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1105.3829v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

The Internals of the Data Calculator [article]

Stratos Idreos, Kostas Zoumpatianos, Brian Hentschel, Michael S. Kester, Demi Guo
<span title="2018-08-06">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
These models are trained on diverse hardware and data profiles and capture the cost properties of fundamental data access primitives (e.g., random access).  ...  Data structures are critical in any data-driven scenario, but they are notoriously hard to design due to a massive design space and the dependence of performance on workload and hardware which evolve continuously  ...  list, binary tree, and hash map.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1808.02066v1">arXiv:1808.02066v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jhtjudqdhvg73bl6hyospqpaxe">fatcat:jhtjudqdhvg73bl6hyospqpaxe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191021095306/https://arxiv.org/pdf/1808.02066v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1808.02066v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Smoothed Complexity Theory [chapter]

Markus Bläser, Bodo Manthey
<span title="">2012</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Smoothed analysis is a hybrid of worst-case and average-case analysis and compensates some of their drawbacks.  ...  Smoothed analysis is a new way of analyzing algorithms introduced by Spielman and Teng (J. ACM, 2004).  ...  As some examples for distributional problems, we will study the bounded halting problem, binary integer optimization, and graph problems under the smoothed extension of G n,p .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-32589-2_20">doi:10.1007/978-3-642-32589-2_20</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qoxszn7flfhkljdle5yfhbyncq">fatcat:qoxszn7flfhkljdle5yfhbyncq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706070202/http://www-cc.cs.uni-saarland.de/media/papers/2012/SmoothedComplexityTheory.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/50/3a/503adb585b28030f933cd2da62b671e84d665357.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-32589-2_20"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Smoothed Complexity Theory

Markus Bläser, Bodo Manthey
<span title="2015-05-11">2015</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/o4i7rml3svgnppoghhzxfanmkm" style="color: black;">ACM Transactions on Computation Theory</a> </i> &nbsp;
Smoothed analysis is a hybrid of worst-case and average-case analysis and compensates some of their drawbacks.  ...  Smoothed analysis is a new way of analyzing algorithms introduced by Spielman and Teng (J. ACM, 2004).  ...  As some examples for distributional problems, we will study the bounded halting problem, binary integer optimization, and graph problems under the smoothed extension of G n,p .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2656210">doi:10.1145/2656210</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/et5ljc53a5bm3irpuu3povutuu">fatcat:et5ljc53a5bm3irpuu3povutuu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706070202/http://www-cc.cs.uni-saarland.de/media/papers/2012/SmoothedComplexityTheory.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/50/3a/503adb585b28030f933cd2da62b671e84d665357.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2656210"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Random Forests of Interaction Trees for Estimating Individualized Treatment Effects in Randomized Trials [article]

Xiaogang Su, Annette T. Peña, Lei Liu, Richard A. Levine
<span title="2017-09-14">2017</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We assess and illustrate the use of RFIT via both simulation and the analysis of data from an acupuncture headache trial.  ...  To this end, we first propose a smooth sigmoid surrogate (SSS) method, as an alternative to greedy search, to speed up tree construction.  ...  In practice, a total of finite B bootstrap sample is taken instead, which makesV subject to additional Monte Carlo noise.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1709.04862v1">arXiv:1709.04862v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/q3vfs7e4vzhctgllz3zg2c46mi">fatcat:q3vfs7e4vzhctgllz3zg2c46mi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200905191856/https://arxiv.org/pdf/1709.04862v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/68/47/68475b1428430af9aead02e9c5df929e02b6d32e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1709.04862v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 91 results