Filters








112 Hits in 5.9 sec

Implementation of a deterministic partial E-unification algorithm for macro tree transducers

Heinz Faßbender, Heiko Vogler, Andrea Wedel, Universität Ulm
<span title="2016-03-15">2016</span>
We formalize the implementation of a deterministic partial E-uni cation algorithm on a deterministic abstract machine, called twin uni cation machine.  ...  The twin uni cation machine uses two runtime stacks it is an extension of an e cient leftmost outermost reduction machine for macro tree transducers.  ...  of BABEL.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.18725/oparu-1679">doi:10.18725/oparu-1679</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tf7bxkbsfvejldfpthkxa6xdbm">fatcat:tf7bxkbsfvejldfpthkxa6xdbm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220119042056/https://oparu.uni-ulm.de/xmlui/bitstream/handle/123456789/1706/vts_7047_9851.pdf;jsessionid=6D9A12B06722C5A014E11FDDAF2EE10A?sequence=1" 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/5b/5d/5b5d13ca18b2f873a13044b7cf371957c60d8e13.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.18725/oparu-1679"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Page 4496 of Mathematical Reviews Vol. , Issue 97G [page]

<span title="">1997</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;
.” 68 COMPUTER SCIENCE 97g:68037 68N17 68Q40 68Q42 Fabbender, Heinz; MéBble, Andrea; Vogler, Heiko Implementation of a deterministic partial F -unification algorithm for macro tree transducers.  ...  We formalize the imple- mentation of a deterministic partial E-unification algorithm on a deterministic abstract machine, called the twin unification ma- chine.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1997-07_97g/page/4496" 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_1997-07_97g/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Subject index volumes 1–200

<span title="">1999</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
, 648 struclures, nonlinear -, 648 transducer, macro -, 83 1 tree transducers, 146 1, 1724, 2072, 2 112, 3799 attributed -, 2112 copying top-down -, 2556 deterministic top-down -, 2556, 2705 macro  ...  macro tree -, 831 transducers, 831,876, 1200, 1461, 1589, 1724.2546, 3520,3799 equivalence problem for finite valued finite -, 909 equivalences of finite valued -, 909 transducers, finite, -, 909 transducers  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(98)00319-3">doi:10.1016/s0304-3975(98)00319-3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/s22ud3iiqjht7lfbtc3zctk7zm">fatcat:s22ud3iiqjht7lfbtc3zctk7zm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170926082047/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/3a5/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDMwNDM5NzU5ODAwMzE5Mw%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] </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(98)00319-3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Cumulative index volumes 1–100

<span title="">1992</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
Vogler, Pushdown machines for the macro tree transducer 42 (3) ( 1986) 251- 368 Engelfriet, J. and H.  ...  Vogler, Pushdown machines for the macro tree transducer (Corngenda) 48 (2- 3)(1986)339 Engelfriet, J. and G.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(92)90292-n">doi:10.1016/0304-3975(92)90292-n</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ekwes6owtrco3lkfkiqagnketq">fatcat:ekwes6owtrco3lkfkiqagnketq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171001004235/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/995/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS8wMzA0Mzk3NTkyOTAyOTJu.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/6f/c5/6fc53e1dd52b832c4178445048d9264b12dade55.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(92)90292-n"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Cumulative index of volumes 1–50

<span title="">1988</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
Akari TOMITA, E., A direct branching algorithm for checking equivalence of strict deterministic vs.  ...  VOGLER, Pushdown machines for the macro tree transducer (Corrigenda) ERSHOV, A.P., Mixed computation: potential applications and problems for study ESIK, 2. and P.  ...  ., An interative and starvation-free solution for a general class of distributed control problems based on interaction primitives WEDDE, H., see A.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(88)90002-3">doi:10.1016/0304-3975(88)90002-3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gasluptczbb6bfplioxrtdrlpy">fatcat:gasluptczbb6bfplioxrtdrlpy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190412155036/https://core.ac.uk/download/pdf/82271427.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/9b/2e/9b2e72ed1ec543e3642771b946a0c37e548affc9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(88)90002-3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

On Sets Turing Reducible to p-Selective Sets

H.-J. Burtschick
<span title="1997-03-01">1997</span> <i title="Springer Nature America, Inc"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qj6jzeossfhihfshwf7nb7lbcq" style="color: black;">Theory of Computing Systems</a> </i> &nbsp;
We show that there is a hierarchy among the sets polynomial-time Turing reducible to p-selective sets with respect to the degree of a polynomial bounding the number of adaptive queries used by a reduction  ...  We give a characterization of EXP/poly in terms of exponential-time Turing reducibility to p-selective sets.  ...  Partial E-Unification Algorithm for Macro Tree Transducers 94-05 V.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s002240000046">doi:10.1007/s002240000046</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vey4chkzpbeknivbu5nc3bvcce">fatcat:vey4chkzpbeknivbu5nc3bvcce</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829230822/http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui/Ulmer_Informatik_Berichte/1995/UIB-1995-09.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/3d/03/3d03c3164ab8223d3bfc87481ed14bb62cca4f32.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s002240000046"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Learning Efficient Disambiguation [article]

Khalil Sima'an
<span title="1999-06-03">1999</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
tree-bank given the specialized grammar, under the constraint that the size of the specialized model does not exceed a predefined maximum, and 3) they enable integrating the specialized model with the  ...  for successful specialization.  ...  The partial-parser can be implemented in various ways among which the most natural is a Cascade of Finite State Transducers.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/9906006v2">arXiv:cs/9906006v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/of6kbtp255clbbboy4m73ite6q">fatcat:of6kbtp255clbbboy4m73ite6q</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-cs9906006/cs9906006.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7d/e7/7de7685bafd3e2e2e6cafaacb72f0e9550bc7509.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/9906006v2" 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>

Towards Modular Development of Typed Unification Grammars

Yael Sygal, Shuly Wintner
<span title="">2011</span> <i title="MIT Press - Journals"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/e4yflo6sufcufjwloald7xudm4" style="color: black;">Computational Linguistics</a> </i> &nbsp;
This work provides preliminary foundations for modular construction of (typed) unification grammars for natural languages.  ...  Development of large-scale grammars for natural languages is a complicated endeavor: Grammars are developed collaboratively by teams of linguists, computational linguists, and computer scientists, in a  ...  All remaining errors are, of course, our own.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1162/coli_a_00035">doi:10.1162/coli_a_00035</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/swtwtlnmcreb5mdpbo5m7b3pqi">fatcat:swtwtlnmcreb5mdpbo5m7b3pqi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110523133539/http://aclweb.org:80/anthology-new/J/J11/J11-1003.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/77/6a/776a7ad11e71b640605fb0e3940ebdb51b934e76.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1162/coli_a_00035"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mitpressjournals.org </button> </a>

Reference list of indexed articles

<span title="">1999</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
Pecuchet, On the complementation of Btlchi automata 47 (1) (1986) 95-98 955. J. Engelfriet and H. Vogler, Pushdown machines for the macro tree transducer (. L.J. Guibas, J. Stolfi and K.L.  ...  Fiilop, A complete description for a monoid of deterministic bottom-up tree transformation classes 88 (2) (1991) 253-268 1653. K.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(98)00320-x">doi:10.1016/s0304-3975(98)00320-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bdgg2ekzdjahdo7g2gtwbdye6m">fatcat:bdgg2ekzdjahdo7g2gtwbdye6m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190415012440/https://core.ac.uk/download/pdf/82678182.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/cf/57/cf5797df1e5fa1505c49b8ac8b0a794dd80d71f4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(98)00320-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Subject index volumes 101–150

<span title="">1995</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
735 tree transducers 72, 112 attributed N 112 copying top-down r~ 556 deterministic top-down N 556, 705 macro N 112 tree transformations 705 deterministic top-down N 705 tree update problem 122  ...  confluence for the A-calculus 321 Takamixawa et al.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(95)90001-2">doi:10.1016/0304-3975(95)90001-2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/omihw2cp6vb2hgwdfiksnt4ftu">fatcat:omihw2cp6vb2hgwdfiksnt4ftu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171002044159/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/b09/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS8wMzA0Mzk3NTk1OTAwMDEy.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/4a/46/4a46a3e5875e6398e823adde43ecd4429cc8a8c1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(95)90001-2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Linear Contexts, Sharing Functors: Techniques for Symbolic Computation [chapter]

Gérard Huet
<span title="">2003</span> <i title="Springer Netherlands"> Applied Logic Series </i> &nbsp;
For 35 years of Automath.  ...  The first one concerns structured editing, or more generally the possibly destructive update of tree-like data-structures of inductive types.  ...  The author wishes to thank the referees of this paper, who made interesting suggestions leading to an improved presentation of the material.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-94-017-0253-9_4">doi:10.1007/978-94-017-0253-9_4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nhaqrstcpvctpenp6tkvjxnv7e">fatcat:nhaqrstcpvctpenp6tkvjxnv7e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809014843/http://pauillac.inria.fr/~huet/PUBLIC/DB.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/2b/3e/2b3e4fc6ea40ca3deffb3fa56766501d6b7115d2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-94-017-0253-9_4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

The translation of programming languages through the use of a graph transformation language

Peter van den Bosch
<span title="1982-03-01">1982</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xu5bk2lj5rbdxlx6222nw7tsxi" style="color: black;">SIGPLAN notices</a> </i> &nbsp;
c) Peter Nico van den Bosch, 1981 by NICO VAN DEN BOSCH in In presenting this thesis in partial fulfilment of the requirements for an advanced degree at the University of British Columbia, I agree that  ...  I further agree that permission for extensive copying of this thesis for scholarly purposes may be granted by the head of my department or by his or her representatives.  ...  For example, the program sequence (Aho and Ullman, p 428): A := B + C; E := C + D + B may be represented by the parse tree: if we make use of a simple DAG construction algorithm (Aho and Ullman, pp 420  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/947912.947920">doi:10.1145/947912.947920</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mp7yt3rb2vh33pvdpfvprechq4">fatcat:mp7yt3rb2vh33pvdpfvprechq4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190428094409/https://open.library.ubc.ca/media/download/pdf/831/1.0051767/1" 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/e2/6b/e26b4bb73c563e5123b6dae7b59b64b99181ed37.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/947912.947920"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

On Toda's Theorem in Structural Communication Complexity [chapter]

Henning Wunderlich
<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;
The proof is based on a new alternating protocol for the inner product function IP with O(log n/ log log n) many alternations.  ...  We prove Toda's Theorem in the context of structural communication complexity, i.e. PH cc ⊆ BP · ⊕P cc ⊆ P cc (#P cc ) = P cc (PP cc ).  ...  Acknowledgement I would like to express my deep gratitude to Martin Dietzfelbinger, Uwe Schöning and Jacobo Torán for careful reading, fruitful discussions, and their support.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-95891-8_54">doi:10.1007/978-3-540-95891-8_54</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zxn2644c2fdz5nqpvdxdfygc7y">fatcat:zxn2644c2fdz5nqpvdxdfygc7y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200320173357/https://www.uni-ulm.de/fileadmin/website_uni_ulm/iui/Ulmer_Informatik_Berichte/2008/UIB_2008-12.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/b5/cb/b5cbe56ee59a7fbb25bbaa7fbf4978dd782c80a2.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-95891-8_54"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Progressive Point-Light-Based Global Illumination

H. Dammertz, A. Keller, H. P. A. Lensch
<span title="2010-08-25">2010</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/p2lpq6bugfcqxk44anrm6yki4m" style="color: black;">Computer graphics forum (Print)</a> </i> &nbsp;
, and a caustic histogram method for the remaining light paths.  ...  Specifically, we combine three distinct algorithms: point-light-based illumination which produces low-noise approximations for diffuse inter-reflections, specular gathering for glossy and singular effects  ...  Wedel Implementation of a Deterministic Partial E-Unification Algorithm for Macro Tree Transducers 94-05 V.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1111/j.1467-8659.2010.01786.x">doi:10.1111/j.1467-8659.2010.01786.x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ajdtopbhkballl3efin3ulhbc4">fatcat:ajdtopbhkballl3efin3ulhbc4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829230611/http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui/Ulmer_Informatik_Berichte/2009/UIB-2009-09.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/ba/f6/baf62727f421dfe5af69eab598ad3d741adb2c67.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1111/j.1467-8659.2010.01786.x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Subject Index to Volumes 1–75

<span title="">2001</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;
, 1861 query, 791 partial modular tree transducer, 2078 partial monadic 2-modular tree transducer, 2078 transformation, 2078 partial Occam razor, 3626 operations, 1372 partial order, 288, 402, 648, 656  ...  time algorithms for finding a maximum matching, 3200 graph search, 3737 linear time and space, 2503, 3560 approximation algorithms, 689 bound, 1984 complexity algorithm, 493 heuristic, 2591 implementation  ...  694, 1269 , 1610 , 1869 , 1924 , 2224 , 2596 , 2825 , 3641 decision problem, 694 rank of a matrix, 3196 order n matrices, 623 tensors, 719 the adjacency matrix of a line graph, 252 rank one matrices,  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0020-0190(01)00175-2">doi:10.1016/s0020-0190(01)00175-2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5y67tfm6yfbblakrus5nnhs73e">fatcat:5y67tfm6yfbblakrus5nnhs73e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20050503052345/http://www.ii.uni.wroc.pl:80/~lorys/IPL/articlesubjindex.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0020-0190(01)00175-2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 112 results