Results 11 to 20 of about 1,256 (79)
Non-polynomial Worst-Case Analysis of Recursive Programs
We study the problem of developing efficient approaches for proving worst-case bounds of non-deterministic recursive programs. Ranking functions are sound and complete for proving termination and worst-case bounds of nonrecursive programs.
A Chakarov +42 more
core +1 more source
Background Matrix Chain Multiplication (MCM) is a fundamental problem in computational mathematics and computer science, often encountered in scientific computing, graphics, and machine learning.
Srinivasarao Thota +2 more
doaj +1 more source
Improving the numerical stability of fast matrix multiplication
Fast algorithms for matrix multiplication, namely those that perform asymptotically fewer scalar operations than the classical algorithm, have been considered primarily of theoretical interest.
Ballard, Grey +4 more
core +1 more source
Faster all-pairs shortest paths via circuit complexity
We present a new randomized method for computing the min-plus product (a.k.a., tropical product) of two $n \times n$ matrices, yielding a faster algorithm for solving the all-pairs shortest path problem (APSP) in dense $n$-node directed graphs with ...
Aho Alfred V. +3 more
core +1 more source
On Invertibility of Large Binary Matrices
Many data processing applications involve binary matrices for storing digital information. At present, there are limited results in the literature about algorithms for inverting large binary matrices.
Ibrahim Mammadov +2 more
doaj +1 more source
Abstract Purpose Reliable gait analysis is essential for clinical assessment and research. Wearable technologies such as the WalkinSense system (WSS), a wireless instrumented insole system equipped with an inertial measurement unit, enable the measurement of spatiotemporal and kinematic gait parameters in real‐world settings.
Melanie Eckelt +10 more
wiley +1 more source
Investigation of Energy and Power Characteristics of Various Matrix Multiplication Algorithms
This work studied the energy behavior of six matrix multiplication algorithms with various physical asset usage patterns. Two were variants of the straight inner product of rows and columns. The rest were variants of Strassen’s divide-and-conquer.
Salem Alsari, Muhammad Al-Hashimi
doaj +1 more source
Four lectures on secant varieties
This paper is based on the first author's lectures at the 2012 University of Regina Workshop "Connections Between Algebra and Geometry". Its aim is to provide an introduction to the theory of higher secant varieties and their applications.
A. Bernardi +101 more
core +1 more source
Abstract We describe the Hettangian Caenogastropoda and Heterobranchia of the Luxembourg Sandstone Formation, a wedge of clastic sediments deposited along the eastern margin of Paris Basin during the Early Jurassic. Five new genera and 11 new species are erected: Bourguetia bipartita sp. nov., Globularia delsatei sp. nov., Oonia feidtorum sp.
Stefano Monari +3 more
wiley +1 more source
Algebraic Methods in the Congested Clique
In this work, we use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model. Specifically, we adapt parallel matrix multiplication implementations to the congested clique, obtaining an $O(n^{1-2 ...
Aho Alfred V. +7 more
core +1 more source

