Sciweavers

1717 search results - page 269 / 344
» A Computable Spectral Theorem
Sort
View
PLILP
1993
Springer
15 years 8 months ago
Higher-Order Chaotic Iteration Sequences
Chaotic iteration sequences is a method for approximating fixpoints of monotonic functions proposed by Patrick and Radhia Cousot. It may be used in specialisation algorithms for ...
Mads Rosendahl
KR
2000
Springer
15 years 7 months ago
Partition-Based Logical Reasoning
We investigate the problem of reasoning with partitions of related logical axioms. Our motivation is two-fold. First, we are concerned with how to reason effectively with multiple...
Eyal Amir, Sheila A. McIlraith
COMPGEOM
1995
ACM
15 years 7 months ago
Triangulations Intersect Nicely
Abstract. We show that there is a matching between the edges of any two triangulations of a planar point set such that an edge of one triangulation is matched either to the identic...
Oswin Aichholzer, Franz Aurenhammer, Michael Tasch...
RTA
1995
Springer
15 years 7 months ago
Completion for Multiple Reduction Orderings
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
Masahito Kurihara, Hisashi Kondo, Azuma Ohuchi
CORR
2008
Springer
110views Education» more  CORR 2008»
15 years 4 months ago
Trimmed Moebius Inversion and Graphs of Bounded Degree
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
Andreas Björklund, Thore Husfeldt, Petteri Ka...