Sciweavers

246 search results - page 5 / 50
» A novel approach to symbolic algebra
Sort
View
PPDP
2007
Springer
14 years 1 months ago
Higher-order semantic labelling for inductive datatype systems
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
Makoto Hamana
COMPGEOM
1997
ACM
13 years 11 months ago
Computing Exact Geometric Predicates Using Modular Arithmetic with Single Precision
Abstract: We propose an e cient method that determines the sign of a multivariate polynomial expression with integer coe cients. This is a central operation on which the robustness...
Hervé Brönnimann, Ioannis Z. Emiris, V...
SIGMOD
2006
ACM
112views Database» more  SIGMOD 2006»
14 years 7 months ago
Join minimization in XML-to-SQL translation: an algebraic approach
Consider an XML view defined over a relational database, and a user query specified over this view. This user XML query is typically processed using the following steps: (a) our t...
Murali Mani, Song Wang, Daniel J. Dougherty, Elke ...
DDECS
2006
IEEE
88views Hardware» more  DDECS 2006»
14 years 1 months ago
Minimization of Large State Spaces using Symbolic Branching Bisimulation
Abstract: Bisimulations in general are a powerful concept to minimize large finite state systems regarding some well-defined observational behavior. In contrast to strong bisimul...
Ralf Wimmer, Marc Herbstritt, Bernd Becker
ISSAC
2005
Springer
125views Mathematics» more  ISSAC 2005»
14 years 27 days ago
Generalized normal forms and polynomial system solving
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
Bernard Mourrain