Sciweavers

16430 search results - page 669 / 3286
» On Computable Tree Functions
Sort
View
FSTTCS
2004
Springer
16 years 19 days ago
Join Algorithms for the Theory of Uninterpreted Functions
The join of two sets of facts, E1 and E2, is defined as the set of all facts that are implied independently by both E1 and E2. Congruence closure is a widely used representation f...
Sumit Gulwani, Ashish Tiwari, George C. Necula
GRAPHITE
2003
ACM
16 years 15 days ago
Point-based modelling and rendering using radial basis functions
A point-based 3D surface modelling technique combined with a new point rendering technique is presented. Surfaces are modelled by specifying a set of unorganized points on the sur...
Patrick Reuter, Ireneusz Tobor, Christophe Schlick...
ANTS
2000
Springer
87views Algorithms» more  ANTS 2000»
15 years 11 months ago
Reduction in Purely Cubic Function Fields of Unit Rank One
This paper analyzes reduction of fractional ideals in a purely cubic function field of unit rank one. The algorithm is used for generating all the reduced principal fractional ide...
Renate Scheidler
TACS
1994
Springer
15 years 11 months ago
An Operational Approach to Combining Classical Set Theory and Functional Programming Languages
Abstract. We have designed a programming logic based on an integration of functional programming languages with classical set theory. The logic merges a classical view of equality ...
Douglas J. Howe, Scott D. Stoller
ICISC
2008
113views Cryptology» more  ICISC 2008»
15 years 8 months ago
Secure Hardware Implementation of Non-linear Functions in the Presence of Glitches
Hardware implementations of cryptographic algorithms are still vulnerable to side-channel attacks. Side-channel attacks that are based on multiple measurements of the same operatio...
Svetla Nikova, Vincent Rijmen, Martin Schläff...