Results 1  10
of
1,304,480
Explaining the GentzenTakeuti reduction steps
, 1997
"... In [Bu97] a precise explanation of Gentzen's reduction steps for derivations in 1st order arithmetic Z (cf. [Ge38]) in terms of (cutelimination for) innitary derivations in!arithmetic was given. Even more, Gentzen's reduction steps and ordinal assignment were derived from innitary proof ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
In [Bu97] a precise explanation of Gentzen's reduction steps for derivations in 1st order arithmetic Z (cf. [Ge38]) in terms of (cutelimination for) innitary derivations in!arithmetic was given. Even more, Gentzen's reduction steps and ordinal assignment were derived from innitary proof
Reduction Steps in Partitions
, 2001
"... of a maximal reduction path in P (n) is linear in n. However, we shall show, for all n 1: there is a reduction path of length 2 n in P ((3n 2 + n)=2) So the maximal reduction path length is superpolynomial, viz. of order 2 p n . This is about the worst you may expect, for log(jP (n)j) = ( ..."
Abstract
 Add to MetaCart
of a maximal reduction path in P (n) is linear in n. However, we shall show, for all n 1: there is a reduction path of length 2 n in P ((3n 2 + n)=2) So the maximal reduction path length is superpolynomial, viz. of order 2 p n . This is about the worst you may expect, for log(jP (n
Data Refinement as Reduction Steps
, 2001
"... this paper this is done for data re nement as de ned in [1], i.e., program re nement, data type re nement and Lsimulation and L simulation of data types are reconstructed as development steps of transformation systems. Then these reconstructions are extended up to arbitrary transformation systems ..."
Abstract
 Add to MetaCart
this paper this is done for data re nement as de ned in [1], i.e., program re nement, data type re nement and Lsimulation and L simulation of data types are reconstructed as development steps of transformation systems. Then these reconstructions are extended up to arbitrary transformation
WaitFree Synchronization
 ACM Transactions on Programming Languages and Systems
, 1993
"... A waitfree implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of constructing a waitfree implementation of one data object from another lie ..."
Abstract

Cited by 849 (28 self)
 Add to MetaCart
A waitfree implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of constructing a waitfree implementation of one data object from another
A scaled conjugate gradient algorithm for fast supervised learning
 NEURAL NETWORKS
, 1993
"... A supervised learning algorithm (Scaled Conjugate Gradient, SCG) with superlinear convergence rate is introduced. The algorithm is based upon a class of optimization techniques well known in numerical analysis as the Conjugate Gradient Methods. SCG uses second order information from the neural netwo ..."
Abstract

Cited by 452 (0 self)
 Add to MetaCart
network but requires only O(N) memory usage, where N is the number of weights in the network. The performance of SCG is benchmarked against the performance of the standard backpropagation algorithm (BP) [13], the conjugate gradient backpropagation (CGB) [6] and the onestep Broyden
A graph reduction step preserving elementconnectivity and applications
 IN INTERNATIONAL COLLOQUIUM ON AUTOMATA, LANGUAGES AND PROGRAMMING
, 2009
"... Given an undirected graph G = (V, E) and subset of terminals T ⊆ V, the elementconnectivity κ ′ G (u, v) of two terminals u, v ∈ T is the maximum number of uv paths that are pairwise disjoint in both edges and nonterminals V \ T (the paths need not be disjoint in terminals). Elementconnectivity ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
connectivity is more general than edgeconnectivity and less general than vertexconnectivity. Hind and Oellermann [21] gave a graph reduction step that preserves the global elementconnectivity of the graph. We show that this step also preserves local connectivity, that is, all the pairwise element
INTERMEDIATE REDUCTION STEPS IMPROVE AUTOMATED MULTILEVEL SUBSTRUCTURING
"... The Automated MultiLevel Substructuring (AMLS) method has been developed to reduce the computational demands of frequency response analysis and has recently been proposed as an alternative to iterative projection methods like Lanczos or Jacobi– Davidson for computing a large number of eigenvalues f ..."
Abstract
 Add to MetaCart
intermediate reduction steps. The efficiency of this approach is demonstrated by a huge gyroscopic eigenvalue problem modelling the dynamic behaviour of a rotating tyre.
RealTime, Continuous Level of Detail Rendering of Height Fields
, 1996
"... We present an algorithm for realtime level of detail reduction and display of highcomplexity polygonal surface data. The algorithm uses a compact and efficient regular grid representation, and employs a variable screenspace threshold to bound the maximum error of the projected image. A coarse lev ..."
Abstract

Cited by 295 (15 self)
 Add to MetaCart
We present an algorithm for realtime level of detail reduction and display of highcomplexity polygonal surface data. The algorithm uses a compact and efficient regular grid representation, and employs a variable screenspace threshold to bound the maximum error of the projected image. A coarse
Solving ForwardBackward Stochastic Differential Equations Explicitly – a Four Step Scheme
 Prob. Th. Rel. Fields
, 1994
"... Abstract. The problem of nding adapted solutions to systems of coupled linear forwardbackward stochastic di erential equations (FBSDEs, for short) is investigated. A necessary condition of solvability leads to a reduction of general linear FBSDEs to a special one. By some ideas from controllability ..."
Abstract

Cited by 243 (19 self)
 Add to MetaCart
Abstract. The problem of nding adapted solutions to systems of coupled linear forwardbackward stochastic di erential equations (FBSDEs, for short) is investigated. A necessary condition of solvability leads to a reduction of general linear FBSDEs to a special one. By some ideas from controllability
Results 1  10
of
1,304,480