Filters








21,189 Hits in 4.5 sec

A fast planar partition algorithm. I

K. Mulmuley
<span title="">1988</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/v4uclqixrrhlnk5pbw4wii6cfq" style="color: black;">[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science</a> </i> &nbsp;
In this paper we give a fast randomized algorithm for finding a partition of the plane induced by a given set of line segments.  ...  Our algorithm is ideally suited for a practical use because: (i) it is extremely simple and robust, and (ii) despite this simplicity (or rather because of it) the algorithm is optimal; its expected running  ...  I. Introduction In this paper we give a fast and efficient randomized algorithm for finding a partition of the plane induced by a given set of line segments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/sfcs.1988.21974">doi:10.1109/sfcs.1988.21974</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/focs/Mulmuley88.html">dblp:conf/focs/Mulmuley88</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tg6enerl4zgtpcwgychu4ykcqu">fatcat:tg6enerl4zgtpcwgychu4ykcqu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170930184107/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/943/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDc0NzcxNzEwODgwMDY0OA%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/08/c1/08c15be29c15dbb4d82f22af8f32e750a95fd1d7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/sfcs.1988.21974"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

A fast planar partition algorithm, I

Ketan Mulmuley
<span title="">1990</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ezljl2d3lzga5efenbxdvvfcpa" style="color: black;">Journal of symbolic computation</a> </i> &nbsp;
In this paper we give a fast randomized algorithm for finding a partition of the plane induced by a given set of line segments.  ...  Our algorithm is ideally suited for a practical use because: (i) it is extremely simple and robust, and (ii) despite this simplicity (or rather because of it) the algorithm is optimal; its expected running  ...  I. Introduction In this paper we give a fast and efficient randomized algorithm for finding a partition of the plane induced by a given set of line segments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0747-7171(08)80064-8">doi:10.1016/s0747-7171(08)80064-8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2lipqlymizfezhz6qctady3pma">fatcat:2lipqlymizfezhz6qctady3pma</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170930184107/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/943/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDc0NzcxNzEwODgwMDY0OA%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/08/c1/08c15be29c15dbb4d82f22af8f32e750a95fd1d7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0747-7171(08)80064-8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems

Dimitrios M. Thilikos, Hans L. Bodlaender
<span title="">1997</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5xfy4fcdxvcvdiybp6iqbffqc4" style="color: black;">Information Processing Letters</a> </i> &nbsp;
A graph is l-apex if it can be made planar by removing at most l vertices.  ...  In this paper we show that the vertex set of any graph not containing an lapex graph as a minor can be quickly partitioned into 2 l sets inducing graphs with small treewidth.  ...  An ; -partition of a graph is a partition fV 1 ; : : : ; V g of its vertices such that treewidthG V i , 1 i . The splitting algorithm The main result of this paper is the following.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0020-0190(97)00024-0">doi:10.1016/s0020-0190(97)00024-0</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hddilfcyszduvmoqp5udlfb7q4">fatcat:hddilfcyszduvmoqp5udlfb7q4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20080425160721/http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-30.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/ce/7d/ce7d81cb0aaf0d394fa23460fbc0cfb996ff684b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0020-0190(97)00024-0"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Approximating the minimum hub cover problem on planar graphs

Belma Yelbay, Ş. İlker Birbil, Kerem Bülbül, Hasan Jamil
<span title="2015-03-31">2015</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5dkx5l3pkjclfd46nyh4eftsrq" style="color: black;">Optimization Letters</a> </i> &nbsp;
We study an approximation algorithm with a performance guarantee to solve a new NP-hard optimization problem on planar graphs.  ...  Our algorithm is based on a well-known graph decomposition technique that partitions the graph into a set of outerplanar graphs and provides an approximate solution with a proven performance ratio.  ...  When the algorithm exits the inner loop, a feasible MHC is obtained for the partition i.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11590-015-0876-5">doi:10.1007/s11590-015-0876-5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xzmopsaflrgjtdsl7nnridg2my">fatcat:xzmopsaflrgjtdsl7nnridg2my</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809033230/https://research.sabanciuniv.edu/27188/1/MHC_Planar_Application.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/a7/19/a71941d878343b57c9e3b61a0b96190d5e97f56a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11590-015-0876-5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Effective Planar Cluster Detection in Point Clouds Using Histogram-Driven Kd-Like Partition and Shifted Mahalanobis Distance Based Regression

Jakub Walczak, Tadeusz Poreda, Adam Wojciechowski
<span title="2019-10-23">2019</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/kay2tsbijbawliu45dnhvyvgsq" style="color: black;">Remote Sensing</a> </i> &nbsp;
Point cloud segmentation for planar surface detection is a valid problem of automatic laser scans analysis.  ...  The proposed partition method produces results with a smaller oversegmentation rate.  ...  Time complexity of these partition algorithms is presented below.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/rs11212465">doi:10.3390/rs11212465</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rrh46i7rbnaa3juqbxes25zspi">fatcat:rrh46i7rbnaa3juqbxes25zspi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200210220719/https://res.mdpi.com/d_attachment/remotesensing/remotesensing-11-02465/article_deploy/remotesensing-11-02465-v3.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/58/75/58756214e8b3ae4ffe8f05a4c2e2faeede4f09f0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/rs11212465"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a>

Page 3394 of Mathematical Reviews Vol. , Issue 92f [page]

<span title="">1992</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;
Mulmuley, Ketan (1-CHI) A fast planar partition algorithm.  ...  Summary of Part I: “We give a fast randomized algorithm for find- ing a partition of the plane induced by a given set of line segments.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1992-06_92f/page/3394" 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_1992-06_92f/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Fast counting with tensor networks [article]

Stefanos Kourtis, Claudio Chamon, Eduardo R. Mucciolo, Andrei E. Ruckenstein
<span title="2018-05-01">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Our results promote tensor network contraction algorithms as a powerful practical tool for fast solution of some #CSPs.  ...  We then use methods of graph theory and computational complexity theory to develop fast tensor contraction protocols.  ...  fast.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1805.00475v1">arXiv:1805.00475v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3zjofkimarb2xjinhvremrxxwu">fatcat:3zjofkimarb2xjinhvremrxxwu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200823021255/https://arxiv.org/pdf/1805.00475v1.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/65/d7/65d7ae327ccc217b65bd32246e7f0be91070105c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1805.00475v1" 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>

Fast Intraframe Coding for High Efficiency Video Coding

<span title="2014-03-31">2014</span> <i title="Korean Society for Internet Information (KSII)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hupfbobgkvepdnt5g32qxkypsy" style="color: black;">KSII Transactions on Internet and Information Systems</a> </i> &nbsp;
Firstly, a fast bottom-up pruning algorithm is designed to skip the mode decision process or reduce the candidate modes at larger block size coding unit.  ...  In this paper, a fast intraframe coding scheme is proposed for HEVC.  ...  In the HEVC test mode (HM), a rate-distortion (RD) optimized bottom-up pruning algorithm [3] is adopted to find the best CU partition of a CTU.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3837/tiis.2014.03.022">doi:10.3837/tiis.2014.03.022</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/p7gyqywmtzfcfhwnmm63wqqzlq">fatcat:p7gyqywmtzfcfhwnmm63wqqzlq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220301203417/http://itiis.org/digital-library/manuscript/file/20489/TIISVol8No3-22.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/a3/e7/a3e7a696151c6cc56639d97118f59909c48992b8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3837/tiis.2014.03.022"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

MultiPlane: A New Framework for Drawing Graphs in Three Dimensions [chapter]

Seok-Hee Hong
<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;
Algorithms that follow this framework vary in computational complexity, depending on the type of graph and the optimisation criteria that are used.  ...  More specifically, the framework divides a graph into a set of smaller subgraphs, and then draws each subgraph in a 2D plane.  ...  Choose a partitioning of a graph G into a set of subgraphs {G i : 1 ≤ i ≤ m}. 2. For each i, 1 ≤ i ≤ m, draw G i in a plane P i using a 2D drawing algorithm. 3.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11618058_49">doi:10.1007/11618058_49</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4753aqzzsvdmpm6k7633ovzjk4">fatcat:4753aqzzsvdmpm6k7633ovzjk4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20090918102141/http://www.cs.usyd.edu.au/~visual/valacon/pdf/hong-gd.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/4b/1b/4b1ba1ef1618d4a32e49244df52242362e060a7f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11618058_49"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Page 8779 of Mathematical Reviews Vol. , Issue 99m [page]

<span title="">1999</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;
If so, the algorithm can also find in linear time a K4 model in G. Implementation of the algorithm has shown that it runs very fast in practice. Hans L.  ...  In so doing they produce a linear time upward planarity testing algorithm that significantly improves previous results. O.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1999-12_99m/page/8779" 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_1999-12_99m/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Cut and Count and Representative Sets on Branch Decompositions

Willem J. A. Pino, Hans L. Bodlaender, Johan M. M. Van Rooij, Marc Herbstritt
<span title="2017-01-31">2017</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tpdnk2xs3fdn5moccz7npe5s24" style="color: black;">International Symposium on Parameterized and Exact Computation</a> </i> &nbsp;
When the involved weights are O(n O(1) ), we obtain faster randomised algorithms on planar graphs for Steiner Tree, Connected Dominating Set, Feedback Vertex Set and TSP, and a faster deterministic algorithm  ...  In particular, we obtain the currently fastest randomised algorithms for several problems on planar graphs.  ...  We have also given fast algorithms, especially on planar graphs, for several connectivity problems.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.ipec.2016.27">doi:10.4230/lipics.ipec.2016.27</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/iwpec/PinoBR16.html">dblp:conf/iwpec/PinoBR16</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yjlsv4sponholcvf4ecojkn4b4">fatcat:yjlsv4sponholcvf4ecojkn4b4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220121001023/https://drops.dagstuhl.de/opus/volltexte/2017/6945/pdf/LIPIcs-IPEC-2016-27.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/86/3e/863e6ccb7e1d402fce0a09b662ddd9a29e368995.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.ipec.2016.27"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs [chapter]

Mohammad Khairul Hasan, Sung-Eui Yoon, Kyung-Yong Chwa
<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;
In this paper, we present a constant factor approximation algorithm for the Minimum Geometric Mean Layout (MGML) problem for bounded-degree planar graphs.  ...  To the best of our knowledge, these are the first results for the MGML problem with bounded-degree planar graphs.  ...  This observation strongly supported that there is possibility that we can have a constant-factor approximation algorithm in terms of minimizing the geometric means.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-02270-8_17">doi:10.1007/978-3-642-02270-8_17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fuak46wvkveoxjia6n4c5mdto4">fatcat:fuak46wvkveoxjia6n4c5mdto4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20131116065546/http://sglab.kaist.ac.kr:80/paper/MGML09.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/c7/4d/c74d7261933b3d9460fe2bd97bebd20319b0f28d.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-02270-8_17"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Three-dimensional non-planar crack growth by a coupled extended finite element and fast marching method

N. Sukumar, D. L. Chopp, E. Béchet, N. Moës
<span title="2008-10-29">2008</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/d5kmo4wqzvfsdp5d4ufrrlufwy" style="color: black;">International Journal for Numerical Methods in Engineering</a> </i> &nbsp;
In this paper, we combine the implementation for non-planar cracks presented in Moës et al. [5] with a fast marching algorithm for crack advance.  ...  Some of the prominent numerical methods used for planar and non-planar crack growth Eq. (2) reduces to a quadratic equation in the unknown value φ i,j,k .  ...  In Section 3, details on the non-planar crack growth algorithm using the fast marching method and its coupling to the X-FEM are presented.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/nme.2344">doi:10.1002/nme.2344</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mu45rwm5cnfw5hoafevbbucjv4">fatcat:mu45rwm5cnfw5hoafevbbucjv4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20080419060723/http://dilbert.engr.ucdavis.edu/~suku/xfem/papers/xfemfmm.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/ec/07/ec07c302e7fef8a7d2cb273d1fdf403c08d5deb1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/nme.2344"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> wiley.com </button> </a>

Fast Scan-Chain Ordering for 3-D-IC Designs Under Through-Silicon-Via (TSV) Constraints

Christina C.-H. Liao, Allen W.-T. Chen, Louis Y.-Z. Lin, Charles H.-P. Wen
<span title="">2013</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/uqbr2omxsbdgtaxslmblka2nnu" style="color: black;">IEEE Transactions on Very Large Scale Integration (vlsi) Systems</a> </i> &nbsp;
This brief addresses the problem of scan-chain ordering under a limited number of through-silicon vias (TSVs), and proposes a fast two-stage algorithm to compute a final order of scan flip-flops.  ...  To enable 3-D optimization, a greedy algorithm, multiple fragment heuristic, is modified and combined with a dynamic closest-pair data structure, FastPair, to derive a good initial solution in stage one  ...  In Section III, a fast two-stage algorithm proposed for scanchain ordering is detailed.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tvlsi.2012.2204781">doi:10.1109/tvlsi.2012.2204781</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hnk3pgyecrfqtbc4dxkcuuxlge">fatcat:hnk3pgyecrfqtbc4dxkcuuxlge</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170813225356/https://ir.nctu.edu.tw/bitstream/11536/22349/1/000319473000016.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/97/69/9769eddeb79d11e9f6a2523037fe9d88bc78f465.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tvlsi.2012.2204781"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Fast Spherical Drawing of Triangulations: An Experimental Study of Graph Drawing Tools

Luca Castelli Aleardi, Gaspard Denis, Éric Fusy, Marc Herbstritt
<span title="2018-06-18">2018</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/lz6rlossxffpddtscflx56wpb4" style="color: black;">Symposium on Experimental and Efficient Algorithms</a> </i> &nbsp;
We consider the problem of computing a spherical crossing-free geodesic drawing of a planar graph: this problem, as well as the closely related spherical parameterization problem, has attracted a lot of  ...  Our main concern is to design and implement a linear time algorithm for the computation of spherical drawings provided with theoretical guarantees.  ...  Finally, we apply the two-phases adaptation of the shift algorithm described in [6] to obtain a planar grid drawing of each map G C i , such that the positions of vertices on the path P i in G C i do  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.sea.2018.24">doi:10.4230/lipics.sea.2018.24</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/wea/AleardiDF18.html">dblp:conf/wea/AleardiDF18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/oonyafnkirdkjmwdr6csmzzfei">fatcat:oonyafnkirdkjmwdr6csmzzfei</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220125203751/https://drops.dagstuhl.de/opus/volltexte/2018/8959/pdf/LIPIcs-SEA-2018-24.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/32/16/3216dcf3c02e6e7d4c93802aa43c665958ee97db.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.sea.2018.24"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 21,189 results