Results 1  10
of
2,505
Making Implicit Parameters Explicit
, 2005
"... In almost all languages all arguments to functions are to be given explicitly. The Haskell class system however is an exception: functions can have class predicates as part of their type signature, and dictionaries are implicitly constructed and implicitly passed for such predicates, thus relieving ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
In almost all languages all arguments to functions are to be given explicitly. The Haskell class system however is an exception: functions can have class predicates as part of their type signature, and dictionaries are implicitly constructed and implicitly passed for such predicates, thus relieving
Implicit parameters: dynamic scoping with static types
 In POPL’00
, 2000
"... This paper introduces a language feature, called implicit parameters, that provides dynamically scoped variables within a staticallytyped HindleyMilner framework. Implicit parameters are lexically distinct from regular identifiers, and are bound by a special with construct whose scope is dynamic, ..."
Abstract

Cited by 93 (4 self)
 Add to MetaCart
This paper introduces a language feature, called implicit parameters, that provides dynamically scoped variables within a staticallytyped HindleyMilner framework. Implicit parameters are lexically distinct from regular identifiers, and are bound by a special with construct whose scope is dynamic
www.cs.uu.nl Explicit implicit parameters
, 2004
"... In almost all languages arguments to functions are to be given explicitly in the program text. There are however a few interesting exceptions to this rule. In Haskell functions take arguments which are either passed explicitly or implicitly. An instance of the latter is the class system in Haskell w ..."
Abstract
 Add to MetaCart
if the builtin proof mechanism fails. In this paper we propose, in the context of Haskell, a mechanism that allows the programmer to explicitly pass implicit parameters. This extension blends well with existing resolution mechanisms for determining which implicit parameters have to be passed, since it only
The Infinite Hidden Markov Model
 Machine Learning
, 2002
"... We show that it is possible to extend hidden Markov models to have a countably infinite number of hidden states. By using the theory of Dirichlet processes we can implicitly integrate out the infinitely many transition parameters, leaving only three hyperparameters which can be learned from data. Th ..."
Abstract

Cited by 637 (41 self)
 Add to MetaCart
We show that it is possible to extend hidden Markov models to have a countably infinite number of hidden states. By using the theory of Dirichlet processes we can implicitly integrate out the infinitely many transition parameters, leaving only three hyperparameters which can be learned from data
Policy gradient methods for reinforcement learning with function approximation.
 In NIPS,
, 1999
"... Abstract Function approximation is essential to reinforcement learning, but the standard approach of approximating a value function and determining a policy from it has so far proven theoretically intractable. In this paper we explore an alternative approach in which the policy is explicitly repres ..."
Abstract

Cited by 439 (20 self)
 Add to MetaCart
represented by its own function approximator, independent of the value function, and is updated according to the gradient of expected reward with respect to the policy parameters. Williams's REINFORCE method and actorcritic methods are examples of this approach. Our main new result is to show
A fourstep camera calibration procedure with implicit image correction
 Proc. IEEE Conf. on Computer Vision and Pattern Recognition
, 1997
"... In geometrical camera calibration the objective is to determine a set of camera parameters that describe the mapping between 3D reference coordinates and 2D image coordinates. Various methods for camera calibration can be found from the literature. However, surprisingly little attention has been ..."
Abstract

Cited by 328 (1 self)
 Add to MetaCart
In geometrical camera calibration the objective is to determine a set of camera parameters that describe the mapping between 3D reference coordinates and 2D image coordinates. Various methods for camera calibration can be found from the literature. However, surprisingly little attention has
ImplicitExplicit RungeKutta Methods for TimeDependent Partial Differential Equations
 Appl. Numer. Math
, 1997
"... Implicitexplicit (IMEX) linear multistep timediscretization schemes for partial differential equations have proved useful in many applications. However, they tend to have undesirable timestep restrictions when applied to convectiondiffusion problems, unless diffusion strongly dominates and an ap ..."
Abstract

Cited by 156 (7 self)
 Add to MetaCart
Implicitexplicit (IMEX) linear multistep timediscretization schemes for partial differential equations have proved useful in many applications. However, they tend to have undesirable timestep restrictions when applied to convectiondiffusion problems, unless diffusion strongly dominates
Guaranteed Ray Intersections with Implicit Surfaces
, 1989
"... In this paper, we present a robust and mathematically sound rayintersection algorithm for implicit surfaces. The algorithm is guaranteed to numerically find the nearest intersection of the surface with a ray, and is guaranteed not to miss fine features of the surface. It does not require fine tuni ..."
Abstract

Cited by 114 (0 self)
 Add to MetaCart
tuning or human choice of interactive parameters. Instead, it requires two upper bounds: "L" that limits the net rate of change of the implicit surface function f(x, y, z) and "G" that limits the rate of change of the gradient. We refer to an implicit surface with these rate limits
Animating Soft Substances with Implicit Surfaces
, 1995
"... This paper presents a hybrid model for animation of soft inelastic substance which undergo topological changes, e.g. separation and fusion and which fit with the objects they are in contact with. The model uses a particle system coated with a smooth isosurface that is used for performing collision ..."
Abstract

Cited by 94 (8 self)
 Add to MetaCart
. Secondly, we avoid unwanted distance blending between disconnected pieces of the same substance. Finally, we simulate both collisions and progressive merging under compression between implicit surfaces that do not blend together. Parameter tuning is facilitated by the layered model and animation
Guaranteeing the Topology of an Implicit Surface Polygonization for Interactive Modeling
, 1997
"... Morse theory shows how the topology of an implicit surface is affected by its function's critical points, whereas catastrophe theory shows how these critical points behave as the function's parameters change. Interval analysis finds the critical points, and they can also be tracked efficie ..."
Abstract

Cited by 108 (10 self)
 Add to MetaCart
Morse theory shows how the topology of an implicit surface is affected by its function's critical points, whereas catastrophe theory shows how these critical points behave as the function's parameters change. Interval analysis finds the critical points, and they can also be tracked
Results 1  10
of
2,505