Sciweavers

867 search results - page 21 / 174
» On Two Forms of Structural Recursion
Sort
View
77
Voted
IPL
2007
97views more  IPL 2007»
15 years 10 days ago
What is a free name in a process algebra?
There are two popular approaches to specifying the semantics of process algebras: labelled transition semantics and reaction semantics. While the notion of free name is rather unp...
Flemming Nielson, Hanne Riis Nielson, Henrik Pileg...
PPOPP
2011
ACM
14 years 3 months ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...
GLOBECOM
2009
IEEE
14 years 10 months ago
Cooperative Uplink of Two Mobile Stations with Network Coding Based on the WiMax LDPC Code
We consider the uplink of two mobile stations with the help of one common relay. Recently, joint network-channel coding based on LDPC codes was proposed for this setup where the ch...
Lena Chebli, Christoph Hausl, Georg Zeitler, Ralf ...
ALT
2003
Springer
15 years 9 months ago
Intrinsic Complexity of Uniform Learning
Inductive inference is concerned with algorithmic learning of recursive functions. In the model of learning in the limit a learner successful for a class of recursive functions mus...
Sandra Zilles
98
Voted
ECOOP
1998
Springer
15 years 4 months ago
The Complexity of Type Analysis of Object Oriented Programs
One of the price tags attached to the blessings that OO brings about is a drop in efficiency due to dynamic method dispatch. Much research effort is being spent on the problem of e...
Joseph Gil, Alon Itai