Sciweavers

154 search results - page 9 / 31
» Cobham recursive set functions
Sort
View
VISUALIZATION
2005
IEEE
14 years 1 months ago
Framework for Visualizing Higher-Order Basis Functions
Techniques in numerical simulation such as the finite element method depend on basis functions for approximating the geometry and variation of the solution over discrete regions ...
William J. Schroeder, François Bertel, Math...
IJCAI
1997
13 years 9 months ago
Recursive Plans for Information Gathering
Generating query-answering plans for information gathering agents requires to translate a user query, formulated in terms of a set of virtual relations, to a query that uses relat...
Oliver M. Duschka, Alon Y. Levy
SETA
2004
Springer
81views Mathematics» more  SETA 2004»
14 years 1 months ago
Univariate and Multivariate Merit Factors
Abstract. Merit factor of a binary sequence is reviewed, and constructions are described that appear to satisfy an asymptotic merit factor of 6.3421 . . . Multivariate merit factor...
Matthew G. Parker
ML
2008
ACM
13 years 7 months ago
Unrestricted pure call-by-value recursion
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
Johan Nordlander, Magnus Carlsson, Andy Gill
APLAS
2007
ACM
13 years 11 months ago
Mixed Inductive/Coinductive Types and Strong Normalization
Abstract. We introduce the concept of guarded saturated sets, saturated sets of strongly normalizing terms closed under folding of corecursive functions. Using this tool, we can mo...
Andreas Abel