Filters








205 Hits in 7.2 sec

A computer implementation of the Push-and-Pull algorithm and its computational comparison with LP simplex method

H. Arsham, G. Cimperman, N. Damij, T. Damij, J. Grad
<span title="">2005</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xkk23xlywfez5l246cnmlit4qq" style="color: black;">Applied Mathematics and Computation</a> </i> &nbsp;
We present a new general-purpose solution algorithm, called Push-and-Pull, which obviates the use of artificial variables.  ...  The Pull Phase pulls the solution back to feasibility using pivoting rules similar to the dual simplex method.  ...  Acknowledgment We are grateful for the referees' useful comment and suggestions. The National Science Foundation Grant CCR-9505732 supported this work.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.amc.2004.10.078">doi:10.1016/j.amc.2004.10.078</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bx3ks3er2rakrbqhqshg74qfxu">fatcat:bx3ks3er2rakrbqhqshg74qfxu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922011259/http://home.ubalt.edu/ntsbarsh/business-stat/opre/pushpull.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/0c/26/0c26ccfefab308793cd226af4042088134b07e46.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.amc.2004.10.078"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Managing cost uncertainties in transportation and assignment problems

V. Adlakha, H. Arsham
<span title="">1998</span> <i title="Hindawi Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4t2n4qrdwjf6rfzlmg7c2jcvey" style="color: black;">Journal of Applied Mathematics and Decision Sciences</a> </i> &nbsp;
In a fast changing global market, a manager is concerned with cost uncertainties of the cost matrix in transportation problems (TP) and assignment problems (AP).A time lag between the development and application  ...  Computational results comparing the proposed algorithm to the closely-related pivotal solution algorithm, the simplex, via the widely-used pack-age Lindo, are provided.  ...  Acknowledgments We are most appreciative to the referees for their useful comments and suggestions. Dr. Arsham's work is supported by NSF Grant CCR-9505732.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/s1173912698000042">doi:10.1155/s1173912698000042</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zyfqiki3djh43dcguyr54k7x2a">fatcat:zyfqiki3djh43dcguyr54k7x2a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20101203180639/http://home.ubalt.edu/ntsbarsh/Business-stat/TP.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/48/a1/48a1701a5cf7dd28d453a74f2de9c862e4e9243f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/s1173912698000042"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> hindawi.com </button> </a>

Feasibility Achievement without the Hassle of Artificial Variables: A Computational Study

Syed Inayatullah, Nasir Touheed, Muhammad Imtiaz, Tanveer Ahmed Siddiqi, Saba Naz, Hafsa Athar Jafree
<span title="2019-04-26">2019</span> <i title="Sciencedomain International"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/yzrmeci6grda7nocskumk2x3ky" style="color: black;">Current Journal of Applied Science and Technology</a> </i> &nbsp;
The purpose of this article is to encourage students and teachers to use a simple technique for finding feasible solution of an LP.  ...  For instance, it does not require any kind of artificial variables or artificial constraints; it could directly start with any infeasible basis of an LP.  ...  , 24] COMPUTATIONAL RESULTS In this section Table 2 and Table 3 present a comparison of the computational results of DP1 algorithm with the SP1.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.9734/cjast/2019/v35i130163">doi:10.9734/cjast/2019/v35i130163</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/z45fexgvkbgyxb5qilsduydy5a">fatcat:z45fexgvkbgyxb5qilsduydy5a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200306230911/http://journalcjast.com/index.php/CJAST/article/download/30163/56601" 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/66/36/663699ce338373773536373edd1535a0fd9bcf7b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.9734/cjast/2019/v35i130163"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

A Streamlined Artificial Variable Free Version of Simplex Method

Syed Inayatullah, Nasir Touheed, Muhammad Imtiaz, Cheng-Yi Xia
<span title="2015-03-13">2015</span> <i title="Public Library of Science (PLoS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/s3gm7274mfe6fcs7e3jterqlri" style="color: black;">PLoS ONE</a> </i> &nbsp;
Later in this paper, a dual version of the new method has also been presented which provides a way to easily implement the phase 1 of traditional dual simplex method.  ...  A general LP problem could be considered as where, x is the decision variable vector, A 2 < mÂn ; b 2 < m ; c 2 < n and m n Artificial-Free Simplex Method PLOS ONE |  ...  Computational Results In this section, tables 1 and 2 present a comparison of the computational results of our algorithm with the simplex method.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1371/journal.pone.0116156">doi:10.1371/journal.pone.0116156</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/25767883">pmid:25767883</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC4358952/">pmcid:PMC4358952</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xsxodelxbfgapi4cbrdx2ova6i">fatcat:xsxodelxbfgapi4cbrdx2ova6i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191130054219/http://europepmc.org/backend/ptpmcrender.fcgi?accid=PMC4358952&amp;blobtype=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/44/be/44be9dd5db3a96cbc654d24631031586e3cb8c3d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1371/journal.pone.0116156"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> plos.org </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4358952" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

Implementing interior point linear programming methods in the Optimization Subroutine Library

J. J. H. Forrest, J. A. Tomlin
<span title="">1992</span> <i title="IBM"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/kj3pclsbb5d3xpd5kqlzmvxa54" style="color: black;">IBM Systems Journal</a> </i> &nbsp;
This class of methods uses quite different computational kernels than the traditional simplex method.  ...  In particular, the matrices we must deal with are symmetric and, although still sparse, are considerably denser than those assumed in simplex implementations.  ...  Acknowledgments We are indebted to Jenny Edwards for converting the ESSLl6000 dense Cholesky routines to function under OSL, to Fred Gustavson for helpful discussions, and to Irvin Lustig for generating  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1147/sj.311.0026">doi:10.1147/sj.311.0026</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kpcxuhvq6fd45ojhsx4vcxh6lq">fatcat:kpcxuhvq6fd45ojhsx4vcxh6lq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060507163720/http://researchweb.watson.ibm.com/journal/sj/311/ibmsj3101E.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/3e/d6/3ed6baeffc115cd4b5fa250ae3855cc588d3b4c5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1147/sj.311.0026"> <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>

FrankWolfe.jl: a high-performance and flexible toolbox for Frank-Wolfe algorithms and Conditional Gradients [article]

Mathieu Besançon and Alejandro Carderera and Sebastian Pokutta
<span title="2021-10-05">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The package is designed with flexibility and high-performance in mind, allowing for easy extension and relying on few assumptions regarding the user-provided functions.  ...  We present FrankWolfe.jl, an open-source implementation of several popular Frank-Wolfe and Conditional Gradients variants for first-order constrained optimization.  ...  ) and the Deutsche Forschungsgemeinschaft (DFG) through the DFG Cluster of Excellence MATH+.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2104.06675v2">arXiv:2104.06675v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/b52nlsiuwnha3hfuzwk3jwnelu">fatcat:b52nlsiuwnha3hfuzwk3jwnelu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20211007044228/https://arxiv.org/pdf/2104.06675v2.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/15/dd/15dd10bcb030e95217836784841a5daf2e5eedcf.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2104.06675v2" 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>

Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming

Mauricio G. C. Resende, K. G. Ramakrishnan, Zvi Drezner
<span title="">1995</span> <i title="Institute for Operations Research and the Management Sciences (INFORMS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/atonzevfefa2vdbi3do6ad2jda" style="color: black;">Operations Research</a> </i> &nbsp;
The linear programs, which can be large even for moderate values of n, are solved with an interior point code that uses a preconditioned conjugate gradient algorithm to compute the directions taken at  ...  Attempts to solve these instances using the CPLEX primal simplex algorithm as well as the CPLEX barrier (primal-dual interior point) method were successful only for the smallest instances.  ...  For the purpose of finding a lower bound for QAP, we do not need to compute the primal solution, and thus terminate the algorithm with only a dual optimal solution.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1287/opre.43.5.781">doi:10.1287/opre.43.5.781</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/h36niqgf2rblleojtoouvfictq">fatcat:h36niqgf2rblleojtoouvfictq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20120119133611/http://www2.research.att.com/~mgcr/doc/qaplp.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/62/176240e77fb9b39cf6848328a92d5b63bc73082f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1287/opre.43.5.781"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

A Review of Applications of Linear Programming to Optimize Agricultural Solutions

Alanoud Alotaibi, Department of Information Systems, Imam Mohammad Ibn Saud Islamic University, Riyadh, Saudi Arabia, Farrukh Nadeem
<span title="2021-04-08">2021</span> <i title="MECS Publisher"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tcr5m4rnxrhl5fvllvhulmhbt4" style="color: black;">International Journal of Information Engineering and Electronic Business</a> </i> &nbsp;
The paper will be a review that will probe into the applications of the LP model and it will also highlight the various tools that are central to analyzing LP model results.  ...  Quantitative methods help farmers plan and make decisions. An apt example of these methods is the linear programming (LP) model.  ...  The work in [36] used the LP model for optimal allocation of the study area's 10 main crops. Simplex algorithms and Push-Pull algorithms provided the solution.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5815/ijieeb.2021.02.02">doi:10.5815/ijieeb.2021.02.02</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ncndffptzvelpkwmpj5h7mym54">fatcat:ncndffptzvelpkwmpj5h7mym54</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210423183452/http://www.mecs-press.org/ijieeb/ijieeb-v13-n2/IJIEEB-V13-N2-2.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/71/6b/716b827910c1dc3d9ea81e75b21fa39c4636cc18.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5815/ijieeb.2021.02.02"> <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>

Feature-Preserving Surface Reconstruction and Simplification from Defect-Laden Point Sets

Julie Digne, David Cohen-Steiner, Pierre Alliez, Fernando de Goes, Mathieu Desbrun
<span title="2013-01-24">2013</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3gper64usvcfvj55pdy33eng4a" style="color: black;">Journal of Mathematical Imaging and Vision</a> </i> &nbsp;
Our approach starts with a (possibly non-manifold) simplicial complex filtered from a 3D Delaunay triangulation of the input points.  ...  Our new feature-sensitive metric between point sets and triangle meshes can also be used as a post-processing tool that, from the smooth output of a reconstruction method, recovers sharp features and boundaries  ...  We also thank the National Science Foundation for partial support through the CCF grant 1011944.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10851-013-0414-y">doi:10.1007/s10851-013-0414-y</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dowrsezmcnatffxxv6qr6skac4">fatcat:dowrsezmcnatffxxv6qr6skac4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20151029120511/https://hal.inria.fr/hal-00827623/file/jmiv.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/9d/54/9d548548a1b4fa804bbe7809fd21711e5a2c94cf.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10851-013-0414-y"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Collaborative Ranking with a Push at the Top

Konstantina Christakopoulou, Arindam Banerjee
<span title="">2015</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/s4hirppq3jalbopssw22crbwwa" style="color: black;">Proceedings of the 24th International Conference on World Wide Web - WWW &#39;15</a> </i> &nbsp;
We consider three specific formulations, based on collaborative p-norm push, infinite push, and reverse-height push, and propose e cient optimization methods for learning these models.  ...  In this paper, building on recent advances from the learning to rank literature, we introduce a novel family of collaborative ranking algorithms which focus on accuracy at the top of the list for each  ...  The work was supported in part by NSF grants IIS-1447566, IIS-1422557,CCF-1451986, CNS-1314560, IIS-0953274, IIS-1029711, NASA grant NNX12AQ39A, and a gift from Yahoo!.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2736277.2741678">doi:10.1145/2736277.2741678</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/www/Christakopoulou15.html">dblp:conf/www/Christakopoulou15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ajjqg2h2dzfixhvamg267tsvdm">fatcat:ajjqg2h2dzfixhvamg267tsvdm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160808110748/http://www2015.org/documents/proceedings/proceedings/p205.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/fc/0b/fc0bd93df318cc49ae21b07f593d513f6336b0a6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2736277.2741678"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

The steepest descent gravitational method for linear programming

Soo Y. Chang, Katta G. Murty
<span title="">1989</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;
The method requires no expensive initialization, and operates only with a small subset of locally active constraints at each step.  ...  We present a version of the gravitational method for linear programming, based on steepest descent gravitational directions.  ...  Acknowledgment We thank the referees for providing some geometric insights and other help in improving the presentation.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0166-218x(89)90002-4">doi:10.1016/0166-218x(89)90002-4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2bzwre3nebczdjoerecnhhms2i">fatcat:2bzwre3nebczdjoerecnhhms2i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100613171924/http://www-personal.umich.edu/~murty/gravitational.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/71/bd/71bdeca382941ea7ef7d3a0ce00cb8192a621a27.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(89)90002-4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Hyperspectral Unmixing Overview: Geometrical, Statistical, and Sparse Regression-Based Approaches

José M. Bioucas-Dias, Antonio Plaza, Nicolas Dobigeon, Mario Parente, Qian Du, Paul Gader, Jocelyn Chanussot
<span title="">2012</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/b2n2tpw5ang73osulebz6bm4ju" style="color: black;">IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing</a> </i> &nbsp;
This paper presents an overview of unmixing methods from the time of Keshava and Mustard's unmixing tutorial [1] to the present. Mixing models are first discussed.  ...  Unmixing involves estimating all or some of: the number of endmembers, their spectral signatures, and their abundances at each pixel.  ...  Green and the AVIRIS team for making the Rcuprite hyperspectral data set available to the community, and the United States Geological Survey (USGS) for their publicly available library of mineral signatures  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/jstars.2012.2194696">doi:10.1109/jstars.2012.2194696</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/s66a35xjd5dqzkw5wwihq6ux64">fatcat:s66a35xjd5dqzkw5wwihq6ux64</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20120714002722/http://www.umbc.edu/rssipl/people/aplaza/Papers/Journals/2012.JSTARS.UnmixingReview.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/72/b1/72b19065ac56ad59f9c96cbab7e3f04293c10614.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/jstars.2012.2194696"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> ieee.com </button> </a>

Reparameterizing the Birkhoff Polytope for Variational Permutation Inference [article]

Scott W. Linderman, Gonzalo E. Mena, Hal Cooper, Liam Paninski, and John P. Cunningham
<span title="2017-10-26">2017</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
To surmount this challenge, we start with the usual step of relaxing a discrete set (here, of permutation matrices) to its convex hull, which here is the Birkhoff polytope: the set of all doubly-stochastic  ...  We then exploit these transformations and reparameterization gradients to introduce variational inference over permutation matrices, and we demonstrate its utility in a series of experiments.  ...  LP is supported by ARO MURI W91NF-12-1-0594, the SCGB, DARPA SIMPLEX N66001-15-C-4032, IARPA MI-CRONS D16PC00003, and ONR N00014-16-1-2176.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1710.09508v1">arXiv:1710.09508v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7is4omzbrfgo7kb7mucdcefso4">fatcat:7is4omzbrfgo7kb7mucdcefso4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200910092759/https://arxiv.org/pdf/1710.09508v1.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/30/21/30216ff66565be212864d6db18deab350c28343b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1710.09508v1" 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>

Identity Matrix [chapter]

<span title="">2013</span> <i title="Springer US"> Encyclopedia of Operations Research and Management Science </i> &nbsp;
It appraises the system at selected time points which allow the system to be analyzed via a discrete-parameter Markov chain.  ...  The queue length process in the M/G/1 queueing system is not Markovian, but can be analyzed via a Markov chain at service completion time points.  ...  Operational research for informed innovation: NHS direct as a case study in the design, implementation and evaluation of a New Public Service.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4419-1153-7_200302">doi:10.1007/978-1-4419-1153-7_200302</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ph4et3usavg4zcpkzfp4yz5qlu">fatcat:ph4et3usavg4zcpkzfp4yz5qlu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180726102058/https://link.springer.com/content/pdf/10.1007%2F978-1-4419-1153-7_200302.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/b7/35/b735d007a970e9561baa86fed5a9908375b15249.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4419-1153-7_200302"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Anytime Point-Based Approximations for Large POMDPs

J. Pineau, G. Gordon, S. Thrun
<span title="2006-11-26">2006</span> <i title="AI Access Foundation"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4ax4efcwajcgvidb6hcg6mwx4a" style="color: black;">The Journal of Artificial Intelligence Research</a> </i> &nbsp;
The second aim of this paper is to provide a thorough empirical comparison between PBVI and other state-of-the-art POMDP methods, in particular the Perseus algorithm, in an effort to highlight their similarities  ...  The first aim of this paper is to introduce this algorithm and present a theoretical analysis justifying the choice of belief selection technique.  ...  The contributions of Michael Montemerlo and Nicholas Roy in conducting the empirical robot evaluations are gratefully acknowledged.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1613/jair.2078">doi:10.1613/jair.2078</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gk4phgieufczjkm5zlegm4jj4m">fatcat:gk4phgieufczjkm5zlegm4jj4m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190427053423/https://jair.org/index.php/jair/article/download/10473/25103" 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/12/13/121307db566345182cd80119f045fb2d6a2f6a2f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1613/jair.2078"> <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>
&laquo; Previous Showing results 1 &mdash; 15 out of 205 results