Results 11  20
of
187
Dynamic ordinals – universal measures for implicit computational complexity
, 2002
"... We extend the definition of dynamic ordinals to generalised dynamic ordinals. We compute generalised dynamic ordinals of all fragments of relativised bounded arithmetic by utilising methods from Boolean complexity theory, similar to Krajíček in [14]. We indicate the role of generalised dynamic ordin ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
ordinals as universal measures for implicit computational complexity. I.e., we describe the connections between generalised dynamic ordinals and witness oracle Turing machines for bounded arithmetic theories. In particular, through the determination of generalised dynamic ordinals we reobtain well
Implicitly restarted Arnoldi with purification for the shiftinvert transformation
 Mathematics of Computation 66
, 1997
"... Abstract. The need to determine a few eigenvalues of a large sparse generalised eigenvalue problem Ax = λBx with positive semidefinite B arises in many physical situations, for example, in a stability analysis of the discretised NavierStokes equation. A common technique is to apply Arnoldi’s method ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
Abstract. The need to determine a few eigenvalues of a large sparse generalised eigenvalue problem Ax = λBx with positive semidefinite B arises in many physical situations, for example, in a stability analysis of the discretised NavierStokes equation. A common technique is to apply Arnoldi’s
A SecondOrder Implicit Knowledge:
"... ABSTRACT The dichotomous epistemology of explicit/implicit knowledge has led to two parallel lines of research; one putting the emphasis on explicit knowledge which has been the main road of elearning, and the other taking implicit knowledge as the core of learning which has shaped a critical line ..."
Abstract
 Add to MetaCart
learning. Accordingly, elearning should happen within the sphere of interplay between explicit and implicit knowledge or theory and practice. In effect, any generalisation should be qualified by informing the student of idiographic aspects of the situation concerned; as any rigidity to the particularities of a
NEW APPLICATIONS OF GENERALISED CURVES, PARTICULARLY IN PHYSICS
, 1980
"... Part I. The traditional assumptions of infinitesimal smoothness, implicitly made in various applied topics, do not agree with what is observed at microscopic and smaller dimensions. Mathematical models closer to what actually occurs, are made possible by the theory of generalised curves, and by th ..."
Abstract
 Add to MetaCart
Part I. The traditional assumptions of infinitesimal smoothness, implicitly made in various applied topics, do not agree with what is observed at microscopic and smaller dimensions. Mathematical models closer to what actually occurs, are made possible by the theory of generalised curves
Deriving Visser's Generalisation: A window into the syntax of control 1
, 2010
"... This paper deals with Visser's Generalisation (VG), an observation about the ungrammaticality of subject control under passivisation that goes back to the early generative literature (Jenkins 1972; Bresnan 1976, 1982; Hust and Brame 1976). On the basis of crosslinguistic data, it is argued tha ..."
Abstract
 Add to MetaCart
), and 2) control is mediated by functional heads, such as T and v, probing for morphological agreement (Borer 1989; Landau 2000 et seq.). This analysis is then shown to explain an intriguing puzzle in the distribution of toughmovement. keywords: Visser's Generalisation, control, implicit arguments
BANACH FAMILIES AND THE IMPLICIT FUNCTION THEOREM
, 2011
"... Abstract. We generalise the classical implicit function theorem (IFT) for a family of Banach spaces, with the resulting implicit function having derivatives that are locally Lipschitz to very strong operator norms. Notation. For Banach spaces X and Y, L(X,Y) is the Banach space of continuous linear ..."
Abstract
 Add to MetaCart
Abstract. We generalise the classical implicit function theorem (IFT) for a family of Banach spaces, with the resulting implicit function having derivatives that are locally Lipschitz to very strong operator norms. Notation. For Banach spaces X and Y, L(X,Y) is the Banach space of continuous linear
Let should not be generalized
, 2009
"... From the dawn of time, all derivatives of the classic HindleyMilner type system have supported implicit generalisation of local letbindings. Yet, as we will show, for more sophisticated type systems implicit letgeneralisation imposes a disproportionate complexity burden. Moreover, it turns out tha ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
From the dawn of time, all derivatives of the classic HindleyMilner type system have supported implicit generalisation of local letbindings. Yet, as we will show, for more sophisticated type systems implicit letgeneralisation imposes a disproportionate complexity burden. Moreover, it turns out
Research Article Visibility Analysis with the Multiscale Implicit TIN
"... Visibility analysis is now a key function of many geographical information systems. It is also one of the most contentious tools, as it is notoriously prone to error. The paper will demonstrate the versatility of the Multiscale Implicit Triangulated Irregular Network (TIN) for the application of int ..."
Abstract
 Add to MetaCart
Visibility analysis is now a key function of many geographical information systems. It is also one of the most contentious tools, as it is notoriously prone to error. The paper will demonstrate the versatility of the Multiscale Implicit Triangulated Irregular Network (TIN) for the application
Implicit Surface Modelling with a Globally Regularised Basis of Compact Support
 EUROGRAPHICS
, 2006
"... We consider the problem of constructing a globally smooth analytic function that represents a surface implicitly by way of its zero set, given sample points with surface normal vectors. The contributions of the paper include a novel means of regularising multiscale compactly supported basis functio ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
We consider the problem of constructing a globally smooth analytic function that represents a surface implicitly by way of its zero set, given sample points with surface normal vectors. The contributions of the paper include a novel means of regularising multiscale compactly supported basis
Implicit Learning in rule induction and problem solving
 Thinking & Reasoning
, 2004
"... Kotovsky, 1997), we studied the effect on rule discovery of having to plan actions or not in order to reach a goal state. This was done by asking participants to predict legal moves as in implicit learning tasks (Experiment 1) and by asking participants to make legal moves as in problemsolving task ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Kotovsky, 1997), we studied the effect on rule discovery of having to plan actions or not in order to reach a goal state. This was done by asking participants to predict legal moves as in implicit learning tasks (Experiment 1) and by asking participants to make legal moves as in problem
Results 11  20
of
187