Journal ArticleDOI
Fast composition of sparse maps
TLDR
A fast algorithm for composition of sparse maps, which act as the identity on most of the elements of their domain) is presented.About:
This article is published in Information Processing Letters.The article was published on 1982-10-31. It has received 0 citations till now. The article focuses on the topics: Sparse approximation.read more
References
More filters
Journal ArticleDOI
On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers
Jacob T. Schwartz,Micha Sharir +1 more
TL;DR: In this paper, a two-dimensional case of the problem is solved, where given a body B and a region bounded by a collection of "walls", either find a continuous motion connecting two given positions and orientations of B during which B avoids collision with the walls, or else establish that no such motion exists.
Journal ArticleDOI
Operations on sparse relations
TL;DR: Various computations on relations, Boolean matrices, or directed graphs, such as the computation of precedence relations for a context-free grammar, can be done by a practical algorithm that is asymptotically faster than those in common use.
Journal ArticleDOI
Evaluating Relational Expressions with Dense and Sparse Arguments
TL;DR: This work considers expressions whose arguments are relations and whose operators are chosen from among $\cup, \circ,{}^*$, and ${}^{ - 1}$, and assumes that operands may be designated “sparse” or “dense”, in a manner to be made formal subsequently.
Related Papers (5)
Integrated Sparse Coding With Graph Learning for Robust Data Representation
Yupei Zhang,Shuhui Liu +1 more