Filters








891,759 Hits in 2.6 sec

Combining Hierarchical Specification with Hierarchical Implementation [chapter]

Naijun Zhan
<span title="">2003</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;
Relating hierarchical specification to hierarchical implementation is an effective method to decrease the complexity of the verification of these systems.  ...  Action refinement is a practical hierarchical method to ease the design of large reactive systems.  ...  As explained in Example 2, at the top level, we can implement the system as: Sys Concluding Remarks In this paper, we extend our previous work on combining hierarchical specification with hierarchical  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-40965-6_8">doi:10.1007/978-3-540-40965-6_8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/r7ujnuvcencxtgws22phv55dwe">fatcat:r7ujnuvcencxtgws22phv55dwe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809135646/http://lcs.ios.ac.cn/~znj/papers/asian03.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/ac/29/ac29dfa45420088bfb9ddc04bcdda08d8505c6ad.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-40965-6_8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Hierarchical Combination of Intruder Theories [chapter]

Yannick Chevalier, Michaël Rusinowitch
<span title="">2006</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;
This has motivated us to introduce a new notion of hierarchical combination for non-disjoint intruder theories and to show decidability results for the deduction problem in these theories.  ...  We have also shown that under natural hypotheses hierarchical intruder constraints can be decided.  ...  Here, we show that we can handle some non-disjoint combinations.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11805618_9">doi:10.1007/11805618_9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rh6pmjwcmrf3jbdebfic6qikcm">fatcat:rh6pmjwcmrf3jbdebfic6qikcm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170929134140/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/7ba/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDg5MDU0MDEwNzAwMTI1Mw%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/a2/57/a25750eba3c77debb52e5660537f327ec6314a24.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11805618_9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Hierarchical combination of intruder theories

Yannick Chevalier, Michael Rusinowitch
<span title="">2008</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/joe2ngto45hbnl3pncnesnq344" style="color: black;">Information and Computation</a> </i> &nbsp;
This has motivated us to introduce a new notion of hierarchical combination for non-disjoint intruder theories and to show decidability results for the deduction problem in these theories.  ...  We have also shown that under natural hypotheses hierarchical intruder constraints can be decided.  ...  Here, we show that we can handle some non-disjoint combinations.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ic.2007.07.004">doi:10.1016/j.ic.2007.07.004</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/irlw623ui5ev3hfy2l6qijhok4">fatcat:irlw623ui5ev3hfy2l6qijhok4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170929134140/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/7ba/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDg5MDU0MDEwNzAwMTI1Mw%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/a2/57/a25750eba3c77debb52e5660537f327ec6314a24.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ic.2007.07.004"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

A refined combination theorem for hierarchically hyperbolic groups [article]

Federico Berlai, Bruno Robbio
<span title="2019-09-24">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Our main result is a wide generalization of a combination theorem of Behrstock, Hagen, and Sisto.  ...  In this work, we are concerned with hierarchically hyperbolic spaces and hierarchically hyperbolic groups.  ...  In this work we provide a new combination theorem for hierarchically hyperbolic spaces (see Theorem A) and groups (see Corollary B).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1810.06476v2">arXiv:1810.06476v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2ry3bkmdkzc6blkmhhfk2rj4dm">fatcat:2ry3bkmdkzc6blkmhhfk2rj4dm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200924160402/https://arxiv.org/pdf/1810.06476v2.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/17/8c/178c4c16226baaf2791a868a21163fc9be35226d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1810.06476v2" 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>

Hierarchically hyperbolic spaces II: Combination theorems and the distance formula [article]

Jason Behrstock, Mark F. Hagen, Alessandro Sisto
<span title="2018-11-28">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We establish this by proving a general combination theorem for trees of HHSs (and graphs of HH groups).  ...  We also introduce a notion of "hierarchical quasiconvexity", which in the study of HHS is analogous to the role played by quasiconvexity in the study of Gromov-hyperbolic spaces.  ...  Theorem 8.6 (Combination theorem for HHS). Let T be a tree of hierarchically hyperbolic spaces.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1509.00632v4">arXiv:1509.00632v4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/46p2b5272fakhlo4s4z2mrkzza">fatcat:46p2b5272fakhlo4s4z2mrkzza</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200928123618/https://arxiv.org/pdf/1509.00632v4.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/dd/be/ddbe9724617344a2cceb828b876d468400b57551.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1509.00632v4" 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>

Hierarchical conceptual spaces for concept combination

Martha Lewis, Jonathan Lawry
<span title="">2016</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/weoplee4x5anpi62cco5v4higa" style="color: black;">Artificial Intelligence</a> </i> &nbsp;
We introduce a hierarchical framework for conjunctive concept combination based on conceptual spaces and random set theory.  ...  Section 4 introduces a framework for concept combination based on a hierarchy of conceptual spaces, and in which compound concepts are defined within Boolean spaces.  ...  Fig. 4 . 4 Schematic of a hierarchical conceptual spaces model for combining concepts.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.artint.2016.04.008">doi:10.1016/j.artint.2016.04.008</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5xi75ctbpvgfllwv27p6t6omye">fatcat:5xi75ctbpvgfllwv27p6t6omye</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190225125704/https://core.ac.uk/download/pdf/81933466.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/16/bb/16bb9effa1f301b376d4a24dc9940e2d26988994.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.artint.2016.04.008"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> elsevier.com </button> </a>

Combining hierarchical radiosity and discontinuity meshing

Dani Lischinski, Filippo Tampieri, Donald P. Greenberg
<span title="">1993</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2lf3s6worzdxvdbhgxxqlrhpbi" style="color: black;">Proceedings of the 20th annual conference on Computer graphics and interactive techniques - SIGGRAPH &#39;93</a> </i> &nbsp;
The approach combines ideas from hierarchical radiosity and discontinuity meshing to yield solutions that are accurate both numerically and visually.  ...  Our results show significant improvements over both hierarchical radiosity and discontinuity meshing algorithms.  ...  The new method combines two recently developed approaches: hierarchical radiosity [14] and discontinuity meshing [15, 18] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/166117.166143">doi:10.1145/166117.166143</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/siggraph/LischinskiTG93.html">dblp:conf/siggraph/LischinskiTG93</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/u3bfqx3sjfa6bmypp3c2vzed7m">fatcat:u3bfqx3sjfa6bmypp3c2vzed7m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20030825205157/http://www.cs.huji.ac.il:80/labs/cglab/papers/hdmr/lischinski-s93.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/ae/a8/aea8f1c2176e72d4c76b84e5d4e26e2b25fbe85b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/166117.166143"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Properties of combinations of hierarchical watersheds

Deise Santana Maia, Jean Cousty, Laurent Najman, Benjamin Perret
<span title="">2019</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6r4znskbk5h2ngu345slqsm6eu" style="color: black;">Pattern Recognition Letters</a> </i> &nbsp;
In [19], the authors provide an evaluation of combinations of hierarchical watersheds, showing that some combinations outperform individual hierarchical watersheds.  ...  Then, we provide a sufficient condition for a combination to always output flattened hierarchical watersheds, and a new combining function that outputs flattened hierarchical watersheds.  ...  Properties of combinations of hierarchical watersheds Combining hierarchical watersheds through their saliency maps raises the question whether the combination of hierarchies is closed for the set of hierarchical  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.patrec.2019.10.009">doi:10.1016/j.patrec.2019.10.009</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/75jbxzdalvcnbg6tytflbuzc5y">fatcat:75jbxzdalvcnbg6tytflbuzc5y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200321163732/https://hal.archives-ouvertes.fr/hal-02175824/document" 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/ab/d7/abd7337971c301c258e66f35cc1481392b5686a2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.patrec.2019.10.009"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Hierarchization for the Sparse Grid Combination Technique [article]

Philipp Hupp
<span title="2013-08-12">2013</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Hierarchization is preprocessing step facilitating the communication needed for the combination technique.  ...  The sparse grid combination technique provides a framework to solve high dimensional numerical problems with standard solvers.  ...  If the coefficients are given in the hierarchical basis, all grid points that do no exist in a combination grid have a coefficient, also called hierarchical surplus, of 0.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1309.0392v1">arXiv:1309.0392v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/znj5haejwfhyvhomw5s56yqyeu">fatcat:znj5haejwfhyvhomw5s56yqyeu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201001040355/https://arxiv.org/pdf/1309.0392v1.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/4f/ca/4fcaad55baf9e3878da867258d8f9c023a4963ee.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1309.0392v1" 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>

Combined convolutional and recurrent neural networks for hierarchical classification of images [article]

Jaehoon Koo, Diego Klabjan, Jean Utke
<span title="2019-11-18">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We propose hierarchical classification models combining a CNN to extract hierarchical representations of images, and an RNN or sequence-to-sequence model to capture a hierarchical tree of classes.  ...  Object classes in many settings have hierarchical relations, and classifiers exploiting these relations should perform better.  ...  Combining CNN as a feature learner with RNN or S2S as a sequence classifier, the proposed models can predict a target path in a hierarchical tree of classes.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1809.09574v3">arXiv:1809.09574v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jb6bjto2bzh4zhpcnzdvee3woy">fatcat:jb6bjto2bzh4zhpcnzdvee3woy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200825021445/https://arxiv.org/pdf/1809.09574v3.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/5f/fc/5ffc3d0269ab4adeb906de426dfc61518a7ef5f6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1809.09574v3" 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>

Bayesian inference in hierarchical models by combining independent posteriors [article]

Ritabrata Dutta and Paul Blomstedt and Samuel Kaski
<span title="2016-04-13">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Hierarchical models are versatile tools for joint modeling of data sets arising from different, but related, sources.  ...  Compared to direct inference in a full hierarchical model, the approach has the advantage of being able to speed up convergence by breaking down the initial large inference problem into smaller individual  ...  The substitute hierarchical model used in combining the posterior samples into a joint inference, is typically very fast to compute.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1603.09272v2">arXiv:1603.09272v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zpky44sqqjccbn3ig7fx6ftsti">fatcat:zpky44sqqjccbn3ig7fx6ftsti</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200905162005/https://arxiv.org/pdf/1603.09272v2.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/11/3f/113f73829a1e242b8c7d6d49ffdbab8d8f779151.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1603.09272v2" 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>

Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems [chapter]

M. R. K. Krishna Rao
<span title="">1995</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;
In this paper, we study modular aspects of hierarchical and super hierarchical combinations of term rewriting systems.  ...  From these results, we obtain modularity of semicompleteness for a class of hierarchical and super hierarchical combinations.  ...  Super-hierarchical Combinations In hierarchical combinations, defined symbols of 7~1 are not allowed to occur in 7~0.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-59293-8_208">doi:10.1007/3-540-59293-8_208</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/algbduxhqzdfxay7bdxnyzsfs4">fatcat:algbduxhqzdfxay7bdxnyzsfs4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190501194736/https://link.springer.com/content/pdf/10.1007%2F3-540-59293-8_208.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/2f/be/2fbeb48dcbf352f0377f5f6ec15155455553ead2.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-59293-8_208"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Combining hierarchical clusterings using min-transitive closure

Abdolreza Mirzaei, Mohammad Rahmati
<span title="">2008</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/mlkexztp5vbdfo3nlsmbuf4oia" style="color: black;">Pattern Recognition (ICPR), Proceedings of the International Conference on</a> </i> &nbsp;
In this paper, a new hierarchical clusterings combination framework is proposed for combining multiple dendrograms directly.  ...  In the past, clusterings combination approaches are based on "flat" clustering algorithms, i.e. algorithms that operate on non-hierarchical clustering schemes.  ...  Min-transitive combination of hierarchical clusterings (MTCH) In this paper, a new method is proposed for hierarchical clusterings combination which is called MTCH.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icpr.2008.4761275">doi:10.1109/icpr.2008.4761275</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icpr/MirzaeiR08.html">dblp:conf/icpr/MirzaeiR08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3uyj3dwm3ffenftmbqnetcuj7q">fatcat:3uyj3dwm3ffenftmbqnetcuj7q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100628191526/http://users.cs.fiu.edu/~lzhen001/File%20Cabinet/Cluster%20Ensembles/Combining%20Hierarchical%20Clustering%20Using%20Min-transitive%20Closure.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/3f/ca/3fca07945df6965cb1cdea1de813df829a1e2751.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icpr.2008.4761275"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Optimal combination forecasts for hierarchical time series

Rob J. Hyndman, Roman A. Ahmed, George Athanasopoulos, Han Lin Shang
<span title="">2011</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/akgkzs3bjzgpdixvnrfpwqkvki" style="color: black;">Computational Statistics &amp; Data Analysis</a> </i> &nbsp;
We call these "hierarchical time series". They are commonly forecast using either a "bottom-up" or a "top-down" method.  ...  Our method is based on independently forecasting all series at all levels of the hierarchy and then using a regression model to optimally combine and reconcile these forecasts.  ...  We use Y t for the Optimal combination forecasts for hierarchical time series aggregate of all series at time t.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.csda.2011.03.006">doi:10.1016/j.csda.2011.03.006</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/26nseskoqjc6lpxyquradppmra">fatcat:26nseskoqjc6lpxyquradppmra</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808132931/http://business.monash.edu/econometrics-and-business-statistics/research/publications/ebs/optimal_combination_forecasts_for_hierarchical_time_series.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/92/73/927314fbd8deb03538bd98be62b6e4075e5b4bb8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.csda.2011.03.006"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

On Hierarchical Reasoning in Combinations of Theories [chapter]

Carsten Ihlemann, Viorica Sofronie-Stokkermans
<span title="">2010</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;
Chapter 5 Combinations of Theories Up to this point we have addressed the question of how to handle the complexity of proof tasks by using hierarchical reasoning.  ...  It gives an implementation for hierarchical reasoning in local theory extensions. We describe the contributions in more detail, combining some of them under a single heading for ease of exposition.  ...  . (_0 < eps --> We used CVC3 to generate a model for the set of clauses obtained after the hierarchical reduction.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-14203-1_4">doi:10.1007/978-3-642-14203-1_4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cqx3nkfh5fbgbbrf5uv7hc7q4q">fatcat:cqx3nkfh5fbgbbrf5uv7hc7q4q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200226022038/https://publikationen.sulb.uni-saarland.de/bitstream/20.500.11880/26067/1/Dissertation_7510_Ihle_Cars_2010.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/46/97/469712dc4dc1341acb46ea4731756d8edfd27205.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-14203-1_4"> <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 891,759 results