Sciweavers

493 search results - page 34 / 99
» types 1998
Sort
View
MOC
1998
140views more  MOC 1998»
14 years 11 months ago
On a high order numerical method for functions with singularities
By splitting a given singular function into a relatively smooth part and a specially structured singular part, it is shown how the traditional Fourier method can be modified to gi...
Knut S. Eckhoff
RSA
1998
59views more  RSA 1998»
14 years 11 months ago
Random unary predicates: Almost sure theories and countable models
Let Un,p be the random unary predicate and Tk the almost sure first-order theory of Un,p under the linear ordering, where k is a positive integer and n−1/k p(n) n−1/(k+1) . F...
Joel Spencer, Katherine St. John
TIP
1998
108views more  TIP 1998»
14 years 11 months ago
Holographic representations of images
Abstract— We discuss a new type of holographic image representations that have advantages in a “distributed” world. We call these representations holographic. Arbitrary porti...
Alfred M. Bruckstein, Robert J. Holt, Arun N. Netr...
ISSTA
1998
ACM
15 years 4 months ago
Verifying Systems with Integer Constraints and Boolean Predicates: A Composite Approach
Symbolic model checking has proved highly successful for large nite-state systems, in which states can be compactly encoded using binary decision diagrams (BDDs) or their variants...
Tevfik Bultan, Richard Gerber, Christopher League
ECOOP
1998
Springer
15 years 4 months ago
Synthesizing Object-Oriented and Functional Design to Promote Re-Use
Many problems require recursively speci ed types ofdata and a collection of tools that operate on those data. Over time, these problems evolve so that the programmer must extend t...
Shriram Krishnamurthi, Matthias Felleisen, Daniel ...