Filters








332,207 Hits in 6.9 sec

Completeness Results for Recursive Data Bases

Tirza Hirst, David Harel
<span title="">1996</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/p6ovb2qpkfenhmb7mcksobrcxq" style="color: black;">Journal of computer and system sciences (Print)</a> </i> &nbsp;
We consider infinite recursive (i.e., computable) relational data bases.  ...  of allowed data bases.  ...  ACKNOWLEDGMENTS We thank the referees for their helpful comments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1006/jcss.1996.0039">doi:10.1006/jcss.1996.0039</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ptwdyb4t3bb3dbky2r5gzdsaua">fatcat:ptwdyb4t3bb3dbky2r5gzdsaua</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190311194229/https://core.ac.uk/download/pdf/82176649.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/45/7c/457c0d1cc0c744390dbac9471e85e9d6705252ee.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1006/jcss.1996.0039"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Dynamic Programming Analysis for Measuring the Optimization of the Manpower per Shift PT. XYZ

Ida Rinjani, Sutrisno Sutrisno, Billy Nugraha
<span title="2021-03-02">2021</span> <i title="Universitas Serambi Mekkah"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5e37lm5rrjgc3oyrapeozhriy4" style="color: black;">Jurnal Serambi Engineering</a> </i> &nbsp;
The results of the research based on the calculation of the forward recursive dynamic programming: shift 1 = 105 people, shift 2 = 104 people and shift 3 = 104 people.  ...  While the solution of the optimal allocation of labor for each shift based on the calculation of the backward recursive dynamic programming: shift 1 = 105 people, shift 2 = 104 people and Shift 3 = 104  ...  Based on Table 8 , the optimal solution of the three stages of completion of Forward Recursive Dynamic Programming is X 1 * = 2, X 3 * = 2, X 3 * = 1.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.32672/jse.v6i2.2868">doi:10.32672/jse.v6i2.2868</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/csbx74sbwrbq3aewcmmos4557m">fatcat:csbx74sbwrbq3aewcmmos4557m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210613144631/http://ojs.serambimekkah.ac.id/jse/article/download/2868/2245" 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/5f/5a/5f5a06a65bae743f40260e53bfee08da0c22c71c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.32672/jse.v6i2.2868"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

EM-based recursive estimation of channel parameters

H. Zamiri-Jafarian, Subbarayan Pasupathy
<span title="">1999</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dha3bnxvkvhslj74k332qi2ewa" style="color: black;">IEEE Transactions on Communications</a> </i> &nbsp;
The estimation of unknown parameters also generates new recursive algorithms for situations, such as additive colored noise modeled by an autoregressive process.  ...  derived directly from the recursive EM algorithm.  ...  While the complete data for estimating is the complete data for estimating at time is however the incomplete data for both is Since less informative complete data improves asymptotic convergence rate  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/26.789663">doi:10.1109/26.789663</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/56nbmi624ncw3iboijz4nvgvd4">fatcat:56nbmi624ncw3iboijz4nvgvd4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170815021459/https://profdoc.um.ac.ir/articles/a/1012907.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/93/d0/93d001894deec3dbac23d5ba6355fb5ada16332a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/26.789663"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Generalized Hampel Filters

Ronald K. Pearson, Yrjö Neuvo, Jaakko Astola, Moncef Gabbouj
<span title="2016-08-05">2016</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hqblpsydr5emviirtqkkmctpha" style="color: black;">EURASIP Journal on Advances in Signal Processing</a> </i> &nbsp;
Partial characterization results are presented for these sequences, as are useful relationships between root sequences for generalized Hampel filters and their median-based counterparts.  ...  To illustrate the performance of this filter class, two examples are considered: one is simulation-based, providing a basis for quantitative evaluation of signal recovery performance as a function of t  ...  same results for the complete noise removal problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1186/s13634-016-0383-6">doi:10.1186/s13634-016-0383-6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7yc6kwhnbbgw5cy4rtpfsl5kcy">fatcat:7yc6kwhnbbgw5cy4rtpfsl5kcy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180720192148/https://research.aalto.fi/files/13003265/art_10.1186_s13634_016_0383_6.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/de/80/de8067e397f8027a7cc79d79d7837b94c9776c7c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1186/s13634-016-0383-6"> <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>

Recursive estimation procedures for missing-data problems

D. M. TITTERINGTON, J-M. JIANG
<span title="">1983</span> <i title="Oxford University Press (OUP)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6oeltljhrzfq7brjdtp2wqehpu" style="color: black;">Biometrika</a> </i> &nbsp;
True maximum likelihood from the available data. VI. Recursive treatment of the complete data.  ...  We have already pointed out the criticism that the results for the recursive methods are order-dependent, an obvious disadvantage for the treatment of a finite data-set.  ...  Theorems are outlined from which asymptotic properties of the recursive procedures can be established and versions of the recursions are written down for problems in which the missing data are missing  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/biomet/70.3.613">doi:10.1093/biomet/70.3.613</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kl2xzyiwwngjvi2en2yg3e2k6e">fatcat:kl2xzyiwwngjvi2en2yg3e2k6e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170927020000/http://www.dtic.mil/get-tr-doc/pdf?AD=ADA124358" 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/30/97/30975ba193c4256a806a22f3fd3c875ac069baa6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/biomet/70.3.613"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> oup.com </button> </a>

'Recursive estimation procedures for missing-data problems'

D. M. TITTERINGTON, J.-M. JIANG
<span title="">1989</span> <i title="Oxford University Press (OUP)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6oeltljhrzfq7brjdtp2wqehpu" style="color: black;">Biometrika</a> </i> &nbsp;
True maximum likelihood from the available data. VI. Recursive treatment of the complete data.  ...  We have already pointed out the criticism that the results for the recursive methods are order-dependent, an obvious disadvantage for the treatment of a finite data-set.  ...  Theorems are outlined from which asymptotic properties of the recursive procedures can be established and versions of the recursions are written down for problems in which the missing data are missing  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/biomet/76.2.408-a">doi:10.1093/biomet/76.2.408-a</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mbspzmsfy5hf3fvghkw62vbdem">fatcat:mbspzmsfy5hf3fvghkw62vbdem</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170927020000/http://www.dtic.mil/get-tr-doc/pdf?AD=ADA124358" 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/30/97/30975ba193c4256a806a22f3fd3c875ac069baa6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/biomet/76.2.408-a"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> oup.com </button> </a>

Recursive Estimation Procedures for Missing-Data Problems

D. M. Titterington, J-M. Jiang
<span title="">1983</span> <i title="JSTOR"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6oeltljhrzfq7brjdtp2wqehpu" style="color: black;">Biometrika</a> </i> &nbsp;
True maximum likelihood from the available data. VI. Recursive treatment of the complete data.  ...  We have already pointed out the criticism that the results for the recursive methods are order-dependent, an obvious disadvantage for the treatment of a finite data-set.  ...  Theorems are outlined from which asymptotic properties of the recursive procedures can be established and versions of the recursions are written down for problems in which the missing data are missing  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2307/2336497">doi:10.2307/2336497</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ux3isdazonaw7eulphdx5qusfu">fatcat:ux3isdazonaw7eulphdx5qusfu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170927020000/http://www.dtic.mil/get-tr-doc/pdf?AD=ADA124358" 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/30/97/30975ba193c4256a806a22f3fd3c875ac069baa6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2307/2336497"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> jstor.org </button> </a>

An Analysis of a Recursive and an Iterative Algorithm for Generating Permutations Modified for Travelling Salesman Problem

Velin Kralev
<span title="2017-10-30">2017</span> <i title="Insight Society"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/micztizddff3zji5xocudzzx64" style="color: black;">International Journal on Advanced Science, Engineering and Information Technology</a> </i> &nbsp;
The obtained results have been analyzed; they show that for the same conditions the iterative algorithm works from of 2 3 to 2 4 times faster than the recursive algorithm in all the tested input data.  ...  This paper presents the results of a comparative analysis between a recursive and an iterative algorithm when generating permutation.  ...  Dafina Kostadinova from the South-West University in Bulgaria, for their suggestions and constructive criticism regarding the paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.18517/ijaseit.7.5.3173">doi:10.18517/ijaseit.7.5.3173</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nccmus7qxjebjaloloxbxr27ui">fatcat:nccmus7qxjebjaloloxbxr27ui</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190430092718/http://www.insightsociety.org/ojaseit/index.php/ijaseit/article/download/3173/1220" 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/c9/fa/c9fa763639aabeba08f181d38e9a81205d5a326e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.18517/ijaseit.7.5.3173"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Enhancing The Performance Of Wireless Sensor Networks Using Low Power Design

N. Mahendran, R. Madhuranthi
<span title="2016-10-01">2016</span> <i title="Zenodo"> Zenodo </i> &nbsp;
This paper presents a simple and accurate data processing scheme for low power wireless sensor node, based on reduced number of processing element (PE).  ...  The presented model provides a simple recursive structure (SRS) to process the sampled data in the wireless sensor environment and to reduce the power consumption in wireless sensor node.  ...  This scheme is based on the resulting architecture in a Xilinx FPGA device for the proof of concept validation.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5281/zenodo.1127532">doi:10.5281/zenodo.1127532</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4s4pjwtvafhmfjigptuhzc4cgu">fatcat:4s4pjwtvafhmfjigptuhzc4cgu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200112135549/https://zenodo.org/record/1127533/files/10005844.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/dc/2a/dc2ac6faa2eb789d9a2cbb1fb7bee38d5f07931b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5281/zenodo.1127532"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> zenodo.org </button> </a>

Page 5249 of Mathematical Reviews Vol. , Issue 98H [page]

<span title="">1998</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
We discuss the test for implication of fuzzy data dependencies. A series of results which are similar to the classical result are obtained in this paper.”  ...  The au- thor stresses that the result does not assume a linearly ordered data domain, which is a technical device for many other express- ibility results in the literature.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1998-08_98h/page/5249" title="read fulltext microfilm" 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> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1998-08_98h/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

A hybrid imputation approach for microarray missing value estimation

Huihui Li, Changbo Zhao, Fengfeng Shao, Guo-Zheng Li, Xiao Wang
<span title="">2015</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4srzxifvfrdlhjhg3dimznkp7m" style="color: black;">BMC Genomics</a> </i> &nbsp;
less complete genes.  ...  Mutual strategy is implemented by sharing the estimated data sequences at each recursive process.  ...  To make full use of those information, an recursive imputation for data sequence is developed to improve all estimation results gradually.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1186/1471-2164-16-s9-s1">doi:10.1186/1471-2164-16-s9-s1</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/26330180">pmid:26330180</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC4547405/">pmcid:PMC4547405</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/q34dsckwrzhyni5zfnkxm6keuq">fatcat:q34dsckwrzhyni5zfnkxm6keuq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171008072042/http://publisher-connector.core.ac.uk/resourcesync/data/Springer-OA/pdf/038/aHR0cDovL2xpbmsuc3ByaW5nZXIuY29tLzEwLjExODYvMTQ3MS0yMTY0LTE2LVM5LVMxLnBkZg%3D%3D.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/36/2b/362b2e918fb9450bb446ee5fa8bb103ff562a2cf.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1186/1471-2164-16-s9-s1"> <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> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4547405" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

Non-Recursive DFT Based Model of Synchrophasor Unit

<span title="2019-12-10">2019</span> <i title="Blue Eyes Intelligence Engineering and Sciences Engineering and Sciences Publication - BEIESP"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cj3bm7tgcffurfop7xzswxuks4" style="color: black;">VOLUME-8 ISSUE-10, AUGUST 2019, REGULAR ISSUE</a> </i> &nbsp;
In this paper, Non-recursive based Discrete Fourier Transform (DFT) approach is implemented for the modelling of PMU due to its stable nature.  ...  Therefore, it is necessary to install Phasor Measurement Devices in the power grid, which can provide a complete state of each bus system.  ...  NON-RECURSIVE BASED DFT APPROACH The DFT technique is divided into recursive and non-recursive method of phasor estimation.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.35940/ijitee.b7759.129219">doi:10.35940/ijitee.b7759.129219</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2tzb233hnveanknkdmd57xgjbi">fatcat:2tzb233hnveanknkdmd57xgjbi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220228014009/https://www.ijitee.org/wp-content/uploads/papers/v9i2/B7759129219.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/b6/5c/b65c977b69234a0b7ed31f74839a934ec49949f9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.35940/ijitee.b7759.129219"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Parallel Triangular Sylvester-Type Matrix Equation Solvers for SMP Systems Using Recursive Blocking [chapter]

Isak Jonsson, Bo Kågström
<span title="">2001</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 present recursive blocked algorithms for solving triangular Sylvester-type matrix equations. Recursion leads to automatic blocking that is variable and \squarish".  ...  Uniprocessor and SMP parallel performance results are presented and compared with results from existing LAPACK routines for solving this type of matrix equations.  ...  Our recursive blocked based algorithms make use of our earlier developed recursive blocked data formats and level 3 BLAS routines 3].  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-70734-4_10">doi:10.1007/3-540-70734-4_10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/g6pdbwihxbbe5a3amazqrh7a7y">fatcat:g6pdbwihxbbe5a3amazqrh7a7y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190222035905/http://pdfs.semanticscholar.org/335b/193e85f114506e1998cd859a8338955f3e95.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/33/5b/335b193e85f114506e1998cd859a8338955f3e95.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-70734-4_10"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Optimizing recursive queries in SQL

Carlos Ordonez
<span title="">2005</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vxrc3vebzzachiwy3nopwi3h5u" style="color: black;">Proceedings of the 2005 ACM SIGMOD international conference on Management of data - SIGMOD &#39;05</a> </i> &nbsp;
To provide an abstract framework for discussion, we focus on computing the transitive closure of a graph.  ...  Recursion represents an important addition to the SQL language. This work focuses on the optimization of linear recursive queries in SQL.  ...  Indexing base and result table for efficient join We assume a recursion depth threshold k. If the partial result table R [s] is empty the recursion stops sooner at step s < k.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1066157.1066260">doi:10.1145/1066157.1066260</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/sigmod/Ordonez05.html">dblp:conf/sigmod/Ordonez05</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/shxhnniqdnffxixfj6hwf36k3e">fatcat:shxhnniqdnffxixfj6hwf36k3e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20120227193321/http://www.cs.uiuc.edu:80/class/fa05/cs591han/sigmodpods05/sigmod/pdf/p834-ordonez.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/ee/23/ee23a9382d08afe1a6d30092b6f7a0bea8cc0d11.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1066157.1066260"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

New Algorithms for Performance Trace Analysis Based on Compressed Complete Call Graphs [chapter]

Andreas Knüpfer, Wolfgang E. Nagel
<span title="">2005</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;
The Complete Call Graph (CCG) data structure is proposed as an alternative to the common linear storage schemes.  ...  Performance Results After the theoretical considerations some performance results shall emphasize the practical advantages of the cCCG based Cached Recursive Queries.  ...  Based on that, the concept of Cached Recursive Queries onto cCCGs is developed in Section 3. Also, it provides some typical examples of use for this algorithm with performance results.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11428848_15">doi:10.1007/11428848_15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bjuzfwkf7zcjpblm6izify73xy">fatcat:bjuzfwkf7zcjpblm6izify73xy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180729064340/https://link.springer.com/content/pdf/10.1007%2F11428848_15.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/4c/33/4c33d813fe097d7c8d6dc745ac0f6b4c2b05d0cc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11428848_15"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 332,207 results