scispace - formally typeset
A

Angel Díaz

Researcher at IBM

Publications -  13
Citations -  333

Angel Díaz is an academic researcher from IBM. The author has contributed to research in topics: Symbolic computation & CPU time. The author has an hindex of 9, co-authored 13 publications receiving 331 citations. Previous affiliations of Angel Díaz include Rensselaer Polytechnic Institute.

Papers
More filters
Patent

Method and system for stylesheet-centric editing

TL;DR: In this paper, a method for enacting changes to a document containing a template-based program that transforms tree-structured data from a first tree-structure data into a second tree-based data, including providing an interface to permit selection of a document, constructing a model of the templatebased program in the selected document, and displaying a representation of the model to the user.
Proceedings ArticleDOI

FOXBOX: a system for manipulating symbolic objects in black box representation

TL;DR: A software package that puts in practice the black box representation of symbolic objects and provides algorithms for performing the symbolic calculus with such representations is introduced and the results of several challenge problems are presented, representing the first symbolic solutions of such problems.
Patent

Method and system for stylesheet execution interactive feedback

TL;DR: In this article, a method for displaying mapping relationships defined by a plurality of instruction elements, each instruction element providing a relation between zero or more source elements and 0 or more result elements is presented.
Journal ArticleDOI

A report on OpenMath: a protocol for the exchange of mathematical information

TL;DR: This report will detail the steps taken to date by the OpenMath Consortium to achieve the aforementioned goals, with emphasis on OpenMath's design goals, initial target applications, and Consortium structure.
Proceedings ArticleDOI

DSC: a system for distributed symbolic computation

TL;DR: This work has tested DSC with a primality test for large integers and with a factorization algorithm for polynomials over large finite fields and observed significant speed-ups over executing the best-known methods on a single workstation computation.