Filters








4,984 Hits in 4.8 sec

Polynomial-time inverse computation for accumulative functions with multiple data traversals

Kazutaka Matsuda, Kazuhiro Inaba, Keisuke Nakano
2012 Higher-Order and Symbolic Computation  
In this paper, we propose an inverse computation method that always terminates for a class of functions known as parameter-linear macro tree transducers, which involve multiple data traversals and the  ...  The key to our method is the observation that a function in the class can be regarded as a non-accumulative context-generating transformation without multiple data traversals.  ...  supported by Japan Society for the Promotion of Science, Grant-in-Aid for Young Scientists (B) 24700020.  ... 
doi:10.1007/s10990-013-9097-8 fatcat:sw4mm54syvaybexrd576y2x73u

Polynomial-time inverse computation for accumulative functions with multiple data traversals

Kazutaka Matsuda, Kazuhiro Inaba, Keisuke Nakano
2012 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation - PEPM '12  
In this paper, we propose an inverse computation method that always terminates for a class of functions known as parameter-linear macro tree transducers, which involve multiple data traversals and the  ...  The key to our method is the observation that a function in the class can be regarded as a non-accumulative context-generating transformation without multiple data traversals.  ...  supported by Japan Society for the Promotion of Science, Grant-in-Aid for Young Scientists (B) 24700020.  ... 
doi:10.1145/2103746.2103752 dblp:conf/pepm/MatsudaIN12 fatcat:uq36ftfirneujk5rsnucbfsj5q

Boosting Memory Access Locality of the Spectral Element Method with Hilbert Space-Filling Curves [article]

Roger R. F. Araújo, Lutz Gross, Samuel Xavier-de-Souza
2021 arXiv   pre-print
We propose an algorithm based on Hilbert space-filling curves to reorder mesh elements in memory for use with the Spectral Element Method, aiming to attain fewer cache misses, better locality of data reference  ...  We reorder mesh-related data via Hilbert curves to achieve sizable reductions in execution time under several mesh configurations in shared-memory systems.  ...  Acknowledgments We would like to thank Adam Ellery of the University of Queensland for his instrumental help and advice regarding SEM and basis functions.  ... 
arXiv:2104.08416v1 fatcat:hylxs6afmreyvntvtzctzhxzsq

Verifiable Set Operations over Outsourced Databases [chapter]

Ran Canetti, Omer Paneth, Dimitrios Papadopoulos, Nikos Triandopoulos
2014 Lecture Notes in Computer Science  
We study the problem of verifiable delegation of computation over outsourced data, whereby a powerful worker maintains a large data structure for a weak client in a verifiable way.  ...  al., ITCS 2012] that can be used to succinctly hash univariate polynomials.  ...  For each internal node v ∈ T (as parsed with a DFS traversal): -Compute set O and its hash value hO = h(CO).  ... 
doi:10.1007/978-3-642-54631-0_7 fatcat:eiopdi3rwbc6do3macapkh6i3u

Large Scale Distributed Linear Algebra With Tensor Processing Units [article]

Adam G.M. Lewis, Jackson Beall, Martin Ganahl, Markus Hauru, Shrestha Basu Mallick, Guifre Vidal
2021 arXiv   pre-print
As examples, we present (i) QR decomposition; (ii) resolution of linear systems; and (iii) the computation of matrix functions by polynomial iteration, demonstrated by the matrix polar factorization.  ...  The TPUs' fast inter-core interconnects (ICI)s, physically two-dimensional network topology, and high-bandwidth memory (HBM) permit distributed matrix multiplication algorithms to rapidly become computationally  ...  All shapes must be computable from "static" data available at compile time, with changes to static data incurring an expensive recompilation.  ... 
arXiv:2112.09017v1 fatcat:ahdbdepkq5ajjc7bcjay5dfaj4

Page 6372 of Mathematical Reviews Vol. , Issue 96j [page]

1996 Mathematical Reviews  
In this paper a method for the lexicographic linear program- ming problem with inexact input data is proposed.  ...  Summary: “We consider shortest path problems defined on graphs with random arc costs. We assume that information on arc cost values is accumulated as the graph is being traversed.  ... 

Teaching Joint-Level Robot Programming with a New Robotics Software Tool

Fernando Gonzalez, Janusz Zalewski
2017 Robotics  
Sample assignments are presented for different levels of difficulty.  ...  With the rising popularity of robotics in our modern world there is an increase in the number of engineering programs that offer the basic Introduction to Robotics course.  ...  It does provide MATLAB functionality to support the student. For example, it can compute the inverse of a matrix needed in computing polynomial trajectories.  ... 
doi:10.3390/robotics6040041 fatcat:5zjjfzhvefblff3pzz5hk4ow5q

Algorithmic complexity in computational biology: basics, challenges and limitations [article]

Davide Cirillo, Miguel Ponce-de-Leon, Alfonso Valencia
2021 arXiv   pre-print
Computational problems can be classified according to their algorithmic complexity, which is defined based on how the resources needed to solve the problem, e.g. the execution time, scale with the problem  ...  Many problems in computational biology are computationally infeasible in the sense that the exhaustive search for the optimal solution is prohibitive in practical terms.  ...  A computational problem belongs to the complexity class P (Polynomial-time) if an algorithm exists for which the number of elementary operations needed to find the solution is bounded by a polynomial function  ... 
arXiv:1811.07312v2 fatcat:f6qnbrilnrh3zomveqptsjbbju

Parallel likelihood calculation for phylogenetic comparative models: The SPLITT C++ library

Venelin Mitov, Tanja Stadler, Tamara Münkemüller
2019 Methods in Ecology and Evolution  
Noticing that the parallel speed-up depends on multiple factors, the SPLITT library is capable to automatically select the fastest traversal strategy for a given hardware, tree-topology, and data.  ...  Combining SPLITT likelihood calculation with adaptive Metropolis sampling on real data, we show that the time for Bayesian POUMM inference on a tree of 10,000 tips can be reduced from several days to less  ...  Krzysztof Bartoszek for valuable insights on the Ornstein-Uhlenbeck process.  ... 
doi:10.1111/2041-210x.13136 fatcat:35trxpqjxjb6tdlompla73p7hu

GPU Robot Motion Planning Using Semi-Infinite Nonlinear Programming

Benjamin Chretien, Adrien Escande, Abderrahmane Kheddar
2016 IEEE Transactions on Parallel and Distributed Systems  
Because each constraint and its gradient can be evaluated independently for each time interval, we end up with a highly parallelizable problem that can take advantage of many-core architectures.  ...  To ensure the continuous satisfaction of our constraints, we use polynomial approximations over time intervals.  ...  Here, we are far from the traditional use case, i.e. polynomial computation with multiple logical dimensions.  ... 
doi:10.1109/tpds.2016.2521373 fatcat:um7bd42atzffrnue2db4qf2yey

TigerGraph: A Native MPP Graph Database [article]

Alin Deutsch, Yu Xu, Mingxi Wu, Victor Lee
2019 arXiv   pre-print
TigerGraph's high-level query language, GSQL, is designed for compatibility with SQL, while simultaneously allowing NoSQL programmers to continue thinking in Bulk-Synchronous Processing (BSP) terms and  ...  We present TigerGraph, a graph database system built from the ground up to support massively parallel computation of queries and analytics.  ...  This algorithm is a severe test of a graph's computational and communication speed because it traverses every edge, computes a score for every node, and repeats this traverse-and-compute for several iterations  ... 
arXiv:1901.08248v1 fatcat:swfqlwudq5e3hgmv74c5mnrqpe

An Automated Framework for Accelerating Numerical Algorithms on Reconfigurable Platforms Using Algorithmic/Architectural Optimization

Jung Sub Kim, Lanping Deng, P. Mangalagiri, K. Irick, K. Sobti, M. Kandemir, V. Narayanan, C. Chakrabarti, N. Pitsianis, Xiaobai Sun
2009 IEEE transactions on computers  
Applications utilizing numerical algorithms on large-size data sets require high-throughput computation platforms.  ...  This paper describes TANOR, an automated framework for designing hardware accelerators for numerical computation on reconfigurable platforms.  ...  Multiply and Accumulate Block In many matrix computations that involve large data sets, accumulation with high accuracy needs to be supported.  ... 
doi:10.1109/tc.2009.78 fatcat:zklqp4ljhngc7jostzhlv2jgpq

A Meta Heuristic Solution for Closest String Problem Using Ant Colony System [chapter]

Faranak Bahredar, Hossein Erfani, H. Haj Seyed Javadi, Nafiseh Masaeli
2010 Advances in Intelligent and Soft Computing  
The proposed algorithm can solve closest substring problem with reasonable time complexity. Experimental results have shown the correctness of algorithm.  ...  The closest substring problem seeks for a substring over ∑ that minimizes the maximum hamming distance with other substrings in S. The closest substring problem is NP-complete.  ...  A polynomial time approximation scheme (PTAS) achieves ratio 1 + ε in polynomial time for any fixed ε > 0.  ... 
doi:10.1007/978-3-642-14883-5_70 dblp:conf/dcai/BahredarEJM10 fatcat:wn6tlraltndsbekrxf5iesbfk4

Efficient Pairings and ECC for Embedded Systems [chapter]

Thomas Unterluggauer, Erich Wenger
2014 Lecture Notes in Computer Science  
The utilization of a multiply-accumulate instructionset extension or a light-weight drop-in hardware accelerator that is placed between CPU and data memory improves runtime up to six times.  ...  In this paper we present three side-channel protected hardware/software designs for pairing-based cryptography yet small and practically fast: our plain ARM Cortex-M0+-based design computes a pairing in  ...  In this case, prime-field multiplications, inversions and point multiplications in G 1 are up to 11.3 times faster, which eventually results in an up to 6.1 times faster computation of pairings.  ... 
doi:10.1007/978-3-662-44709-3_17 fatcat:mnztmxjlybawznmyu3i3tq4deq

Spectral Predictors

Lorenzo Ibarria, Peter Lindstrom, Jarek Rossignac
2007 2007 Data Compression Conference (DCC'07)  
We show that predictive coding using our spectral predictor improves compression for various sources of high-precision data.  ...  Lossless compression of such data is commonly done using predictive coding, in which weighted combinations of previously coded samples known to both encoder and decoder are used to predict subsequent nearby  ...  1 (2) In the limit, L 2 reproduces functions f with ∂ 4 f ∂x 2 ∂y 2 = 0, and in the discrete setting interpolates biquadratic polynomials without highest order term x 2 y 2 .  ... 
doi:10.1109/dcc.2007.72 dblp:conf/dcc/IbarriaLR07 fatcat:yo7ah2nr5jbnlmlqm24gnbfroe
« Previous Showing results 1 — 15 out of 4,984 results