292 search results - page 41 / 59 » A linearization of the Lambda-calculus and consequences |
WG
1995
Springer
15 years 4 months ago
1995
Springer
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...
117
click to vote
AISB
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. The aim of this paper is to try to understand the structure of time in information technologies. Starting with historical arguments, it first shows that time is neither l...
104
click to vote
CSR
2008
Springer
15 years 3 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
145
click to vote
ETVC
2008
15 years 3 months ago
2008
In a seminal paper, Amari (1998) proved that learning can be made more efficient when one uses the intrinsic Riemannian structure of the algorithms' spaces of parameters to po...
119
click to vote
APVIS
2008
15 years 2 months ago
2008
In the field of Volume Rendering, pre-integration techniques for arbitrary transfer functions has certainly led to the most significant and convincing results both quality and per...