2,575 Hits in 6.0 sec

Reasoning About Recursive Tree Traversals [article]

Yanjun Wang, Jinwei Liu, Dalin Zhang, Xiaokang Qiu
2019 arXiv   pre-print
Existing approaches to reasoning about tree traversals and their transformations are ad hoc, with various limitations on the class of traversals they can handle, the granularity of dependence analysis,  ...  We propose Retreet, a framework in which one can describe general recursive tree traversals, precisely represent iterations, schedules and dependences, and automatically check data-race-freeness and transformation  ...  [19] provide a domain specific fusion compiler that fuse traversals of k-d trees in computational simulations. Both the frameworks are ad hoc, designed to serve specific applications.  ... 
arXiv:1910.09521v2 fatcat:mztoc6ppsfel7o3dtsq3zcrr4u

Multisensor Biometric Evidence Fusion for Person Authentication Using Wavelet Decomposition and Monotonic-Decreasing Graph

Dakshina Ranjan Kisku, Jamuna Kanta Sing, Massimo Tistarelli, Phalguni Gupta
2009 2009 Seventh International Conference on Advances in Pattern Recognition  
images by searching corresponding points using recursive descent tree traversal approach.  ...  When the fused image is ready for further processing, SIFT operator are then used for feature extraction and the recognition is performed by adjustable structural graph matching between a pair of fused  ...  For matching, correspondence has been established by searching feature points on a pair of fused images using recursive approach based tree traversal algorithm.  ... 
doi:10.1109/icapr.2009.15 dblp:conf/icapr/KiskuSTG09 fatcat:7w7ajqwdavhnbbvsllb4sier2u

Energy-Efficient Chain Formation Algorithm for Data Gathering in Wireless Sensor Networks

Se-Jung Lim, Myong-Soon Park
2012 International Journal of Distributed Sensor Networks  
PEGASIS, one of the well-known chain-based routing protocols for improving energy efficiency, builds a chain based on the greedy algorithm.  ...  For this reason, there has been abundant research on improving energy efficiency.  ...  Radio model Formulas Transmitting E TX (k, d) = E TX-elec (k) + E TX-amp (k, d) E TX (k, d) = E elec * k + amp * k * d 2 Receiving E RX (k) = E RX-elec (k) E RX (k) = E elec * k for fair evaluation.  ... 
doi:10.1155/2012/843413 fatcat:6eafm6bedbbbnatlxgtq3d2j3i

Generic deriving of generic traversals

Csongor Kiss, Matthew Pickering, Nicolas Wu
2018 Proceedings of the ACM on Programming Languages  
Full terms of use are available: Functional programmers have an established tradition of using traversals as a design pattern to work with recursive data structures.  ...  Furthermore, since lenses and traversals are based on the generic shape of data, this information is used to generate code that is as efficient as hand-optimised versions.  ...  For example, imagine a traversal tree :: Traversal (Tree a) (Tree b) a b that focuses on all the elements in a tree.  ... 
doi:10.1145/3236780 dblp:journals/pacmpl/KissPW18 fatcat:6di3rjjt5vhq7n3tspyqeu22km

Postcondition-preserving fusion of postorder tree transformations

Eleanor Davies, Sara Kalvala
2020 Proceedings of the 29th International Conference on Compiler Construction  
Fusion strategies for combining such successive tree transformations promote this modularity, whilst mitigating the performance impact from increased numbers of tree traversals.  ...  Existing approaches to fusing tree transformations tend to take an informal approach to soundness, or be too restrictive to consider the kind of transformations needed in a compiler.  ...  [17, 18] looked at automatically finding the optimal fusion schedule for recursive traversals of k-d trees.  ... 
doi:10.1145/3377555.3377884 dblp:conf/cc/DaviesK20 fatcat:oicmvv2dwbhslkgtniogav7oym

Generic Deriving of Generic Traversals [article]

Csongor Kiss, Matthew Pickering, Nicolas Wu
2018 arXiv   pre-print
Functional programmers have an established tradition of using traversals as a design pattern to work with recursive data structures.  ...  Furthermore, since our lenses and traversals are based on the generic shape of data, we are able to use this information to produce code that is as efficient as hand-written versions.  ...  For example, we could imagine a traversal tree :: Traversal (Tree a) (Tree b) a b that focuses on all the elements in a tree.  ... 
arXiv:1805.06798v1 fatcat:uyhyogxdlreppmsaqa4qa6jgty

Profunctor Optics: Modular Data Accessors

Matthew Pickering, Jeremy Gibbons, Nicolas Wu
2017 The Art, Science, and Engineering of Programming  
CONTEXT: Data accessors allow one to read and write components of a data structure, such as the fields of a record, the variants of a union, or the elements of a container.  ...  Generally, one has to write a sequence of statements or declarations that navigate step by step through the data structure, accessing one level at a time - which is to say, data accessors are traditionally  ...  The work has been partially supported by the UK EPSRC-funded project A Theory of Least Change for Bidirectional Transformations (EP/K / ).  ... 
doi:10.22152/ fatcat:ws4yeo3n4vawdfd5kg6hi2zme4

Getting There and Back Again [article]

Olivier Danvy
2022 arXiv   pre-print
"There and Back Again" (TABA) is a programming pattern where the recursive calls traverse one data structure and the subsequent returns traverse another.  ...  In addition, this article identifies and illustrates a tail-recursive variant of TABA, There and Forth Again (TAFA) that does not come back but goes forth instead with more tail calls.  ...  Acknowledgments Heartfelt thanks to Mayer Goldberg for the original continuation-based implementation of symbolic convolutions and for our subsequent joint study of its recursion pattern.  ... 
arXiv:2203.00145v3 fatcat:nduvqgfrhfe7bfp2tnr74up4qi

An N N Parallel Fast Direct Solver for Kernel Matrices [article]

Chenhan D. Yu, William B. March, George Biros
2017 arXiv   pre-print
Given N points in d dimensions and a kernel function that requires O(d) work to evaluate, we present an O(dN N)-work algorithm for the approximate factorization of a regularized kernel matrix, a common  ...  computational bottleneck in the training phase of a learning task.  ...  The factorization of K proceeds using a bottomup traversal of the tree. At the leaf level, we factorize K −1 αα ∈ R m×m using LAPACK's GETRF.  ... 
arXiv:1701.02324v1 fatcat:cmr5qrd6breh5e6wj67vb56tra

Video Expression Recognition Method Based on Spatiotemporal Recurrent Neural Network and Feature Fusion

Xuan Zhou
2021 Journal of Information Processing Systems  
Finally, the fused features are input to the support vector machine to realize the facial expression classification task.  ...  The experimental results on cNTERFACE, RML, and AFEW6.0 datasets show that the recognition rates obtained by the proposed method are as high as 88.67%, 70.32%, and 63.84%, respectively.  ...  The sparse projection process can be expressed as follows: 1 , 1, , K r r r tl il ti d i s G h l K = = = ∑ (6) After sparse projection, all the features of the temporal recursive layer can be integrated  ... 
doi:10.3745/jips.01.0067 dblp:journals/jips/Zhou21 fatcat:qmy3by7vgvc5rl67ithpmrvxv4

General transformations for GPU execution of tree traversals

Michael Goldfarb, Youngjoon Jo, Milind Kulkarni
2013 Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis on - SC '13  
We demonstrate these techniques on several tree traversal algorithms, achieving speedups of up to 38× over 32-thread CPU versions.  ...  Recently, irregular algorithms such as Barnes-Hut and kd-tree traversals have been implemented on GPUs, yielding significant performance gains over CPU implementations.  ...  The authors would like to thank Sriram Krishnamoorthy and Michael Garland for discussions regarding the effects of the lockstep transformation.  ... 
doi:10.1145/2503210.2503223 dblp:conf/sc/GoldfarbJK13 fatcat:gcoxb5djm5gsfpsuoqay6yosde

Construction of list homomorphisms by tupling and fusion [chapter]

Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi
1996 Lecture Notes in Computer Science  
In this paper, we propose a systematic way of embedding them into list homomorphisms so that parallel programs are derived.  ...  We show, with an example, how a simple, and \obviously" correct, but possibly inecient solution to the problem can be successfully turned into a semantically equivalent almost homomorphism by means of  ...  For example, 8= can be computed in parallel on a tree-like structure with the combining operator 8 applied in the nodes, whereas f3 is totally parallel.  ... 
doi:10.1007/3-540-61550-4_166 fatcat:hhmo67lgujckpohew7hz3t3jla

Datatype-Generic Programming [chapter]

Jeremy Gibbons
2007 Lecture Notes in Computer Science  
In these lecture notes, we expand on the definition of datatype-generic programming, and present some examples of datatypegeneric programs.  ...  The term means different things to different people: parametric polymorphism, data abstraction, meta-programming, and so on.  ...  Is it possible to fuse the two traversals into one?  ... 
doi:10.1007/978-3-540-76786-2_1 fatcat:qulchjxhw5hjrau7vjsbhhhtx4

Composable, sound transformations of nested recursion and loops

Kirshanthan Sundararajah, Milind Kulkarni
2019 Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2019  
of composed transformations.  ...  This paper presents an approach for composing and applying scheduling transformations-like inlining, interchange, and code motion-to nested recursive programs.  ...  Acknowledgments This work was supported in part by National Science Foundation award CCF-1725672, and by Department of Energy award DE-SC0010295.  ... 
doi:10.1145/3314221.3314592 dblp:conf/pldi/Sundararajah019 fatcat:ezp233zcv5hyddy25pmfi5hx2m

The Peano software - parallel, automaton-based, dynamically adaptive grid traversals [article]

Tobias Weinzierl
2018 arXiv   pre-print
We formalize the software design by means of two interacting automata---one automaton for the multiscale grid traversal and one for the application-specific algorithmic steps.  ...  This transforms our report from a "one way to implement things" code description into a generic discussion and summary of some alternatives, rationale and design decisions to be made for any tree-based  ...  The paper is dedicated to Christoph Zenger who kicked off and supervised the implementation of the first generation of Peano.  ... 
arXiv:1506.04496v6 fatcat:iwgintogxjgiviybhvymz5xxou
« Previous Showing results 1 — 15 out of 2,575 results