Results 1  10
of
187
Implicit volume rendering of generalised cylinders
, 1994
"... This paper addresses the issue of rendering the interior volume of generalised cylinders that are filled with a semitranslucent material. A point sampling method is proposed. Volumes that are defined by combining generalised cylinders via set theoretic operations may be rendered also.The original ..."
Abstract
 Add to MetaCart
This paper addresses the issue of rendering the interior volume of generalised cylinders that are filled with a semitranslucent material. A point sampling method is proposed. Volumes that are defined by combining generalised cylinders via set theoretic operations may be rendered also.The original
Let should not be generalised
 TLDI'10
, 2010
"... 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 th ..."
Abstract

Cited by 1 (0 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
Formalising Generalised Substitutions
"... Abstract. We use the theorem prover Isabelle to formalise and machinecheck results of the theory of generalised substitutions given by Dunne and used in the B method. We describe the model of computation implicit in this theory and show how this is based on a compound monad, and we contrast this mod ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. We use the theorem prover Isabelle to formalise and machinecheck results of the theory of generalised substitutions given by Dunne and used in the B method. We describe the model of computation implicit in this theory and show how this is based on a compound monad, and we contrast
Generalised Kernel Machines
"... Abstract — The generalised linear model (GLM) is the standard approach in classical statistics for regression tasks where it is appropriate to measure the data misfit using a likelihood drawn from the exponential family of distributions. In this paper, we apply the kernel trick to give a nonlinear ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
linear variant of the GLM, the generalised kernel machine (GKM), in which a regularised GLM is constructed in a fixed feature space implicitly defined by a Mercer kernel. The MATLAB symbolic maths toolbox is used to automatically create a suite of generalised kernel machines, including methods for automated
Generalised elastic nets
, 2003
"... The elastic net was introduced as a heuristic algorithm for combinatorial optimisation and has been applied, among other problems, to biological modelling. It has an energy function which trades off a fitness term against a tension term. In the original formulation of the algorithm the tension term ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
was implicitly based on a firstorder derivative. In this paper we generalise the elastic net model to an arbitrary quadratic tension term, e.g. derived from a discretised differential operator, and give an efficient learning algorithm. We refer to these as generalised elastic nets (GENs). We give a theoretical
Implicitly Restarting Lanczos
, 1997
"... We show in this text how the idea of the Implicitly Restarted Arnoldi method can be generalised to the nonsymmetric Lanczos algorithm, using the twosided GramSchmidt process or using a Lanczos tridiagonalisation. The implicitly restarted Lanczos method can be combined with an implicit filter. It ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We show in this text how the idea of the Implicitly Restarted Arnoldi method can be generalised to the nonsymmetric Lanczos algorithm, using the twosided GramSchmidt process or using a Lanczos tridiagonalisation. The implicitly restarted Lanczos method can be combined with an implicit filter
Generalisation with Symbolic Knowledge in Online Classification
"... Abstract. Increasingly, researchers and developers of knowledge based systems (KBS) have been incorporating the notion of context. For instance, Repertory Grids, Formal Concept Analysis (FCA) and RippleDown Rules (RDR) all integrate either implicit or explicit contextual information. However, these ..."
Abstract
 Add to MetaCart
Abstract. Increasingly, researchers and developers of knowledge based systems (KBS) have been incorporating the notion of context. For instance, Repertory Grids, Formal Concept Analysis (FCA) and RippleDown Rules (RDR) all integrate either implicit or explicit contextual information. However
Drawing Implicit Functions
"... A common problem is to translate an implicit relationship such as the ellipse: x2+2y2+4x+6y =5 into graphical form. By manipulating the algebra it is possible to solve for y in terms of x (using positive and negative square roots) and then to plot points (x,y) on the curve. But this approach does no ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
not generalise easily and proves utterly impracticable for a more complicated relation such as ysinx + xcosy = 1. Fortunately it is a relatively simple matter to program numerical methods to draw a more general implicit function f(x,y) = constant without solving the relationship explicitly
USE OF GRAPH THEORY TO SUPPORT GENERALISATION
"... This paper discusses the utilization of graph theory to aid in the subtle application of specific generalization techniques during map design. The visualization of space encapsulates the notion of context, the representation of the interdependence of salient variables and even that of aesthetics; ma ..."
Abstract
 Add to MetaCart
; many of the subtleties of the cartographic hand rely on a rich understanding of those relationships. It is argued that any equivalent automated system needs to have the same rich knowledge explicitly or implicitly stored with each feature. The consequences for database design from this perspective
Feature Selection and Generalisation for Retrieval of Textual Cases
 IN PROCEEDINGS OF 7TH EUROPEAN CONFERENCE ON CASEBASED REASONING (ECCBR’04), VOLUME 3155
, 2004
"... Textual CBR systems solve problems by reusing experiences that are in textual form. Knowledgerich comparison of textual cases remains an important challenge for these systems. However mapping text data into a structured case representation requires a significant knowledge engineering effort. In thi ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
is employed to capture feature cooccurrence patterns. Generalised features are constructed by applying these rules. Essentially, rules preserve implicit semantic relationships between features and applying them has the desired effect of bringing together cases that would have otherwise been overlooked during
Results 1  10
of
187