Results 1  10
of
8,891
Nonlinear total variation based noise removal algorithms
, 1992
"... A constrained optimization type of numerical algorithm for removing noise from images is presented. The total variation of the image is minimized subject to constraints involving the statistics of the noise. The constraints are imposed using Lagrange multipliers. The solution is obtained using the g ..."
Abstract

Cited by 2271 (51 self)
 Add to MetaCart
of the image, and a second step which projects the image back onto the constraint set.
Trade Liberalization, Exit, and Productivity Improvements: Evidence from Chilean Plants
 Review of Economic Studies
, 2002
"... This paper empirically investigates the effects of liberalized trade on plant productivity in the case of Chile. Chile presents an interesting setting to study this relationship since it underwent a massive trade liberalization that significantly exposed its plants to competition from abroad during ..."
Abstract

Cited by 555 (16 self)
 Add to MetaCart
on consistent estimates of the input coefficients. In the second step, I identify the impact of trade on plants’ productivity in a regression framework allowing variation in productivity over time and across tradedand nontradedgoods sectors. Using plantlevel panel data on Chilean manufacturers, I find
Software pipelining: An effective scheduling technique for VLIW machines
, 1988
"... This paper shows that software pipelining is an effective and viable scheduling technique for VLIW processors. In software pipelining, iterations of a loop in the source program are continuously initiated at constant intervals, before the preceding iterations complete. The advantage of software pipe ..."
Abstract

Cited by 581 (3 self)
 Add to MetaCart
This paper shows that software pipelining is an effective and viable scheduling technique for VLIW processors. In software pipelining, iterations of a loop in the source program are continuously initiated at constant intervals, before the preceding iterations complete. The advantage of software
Formalising trust as a computational concept
, 1994
"... Trust is a judgement of unquestionable utility — as humans we use it every day of our lives. However, trust has suffered from an imperfect understanding, a plethora of definitions, and informal use in the literature and in everyday life. It is common to say “I trust you, ” but what does that mean? T ..."
Abstract

Cited by 529 (6 self)
 Add to MetaCart
before going deeper. In consequence it may seem that the subject is not receiving a thorough treatment, or that too much is being discussed at one time! (This is particularly apparent in the first and second chapters.) To present a thorough understanding of trust, we have proceeded breadth first
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 451 (0 self)
 Add to MetaCart
and avoids a time consuming linesearch, which CGB and BFGS uses in each iteration in order to determine an appropriate step size.
Incorporating problem dependent structural information in the architecture of a neural network often lowers the overall complexity. The smaller the complexity of the neural
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
that the gradient can be written in a form suitable for estimation from experience aided by an approximate actionvalue or advantage function. Using this result, we prove for the first time that a version of policy iteration with arbitrary differentiable function approximation is convergent to a locally optimal
NonDeterministic Exponential Time has TwoProver Interactive Protocols
"... We determine the exact power of twoprover interactive proof systems introduced by BenOr, Goldwasser, Kilian, and Wigderson (1988). In this system, two allpowerful noncommunicating provers convince a randomizing polynomial time verifier in polynomial time that the input z belongs to the language ..."
Abstract

Cited by 416 (37 self)
 Add to MetaCart
We determine the exact power of twoprover interactive proof systems introduced by BenOr, Goldwasser, Kilian, and Wigderson (1988). In this system, two allpowerful noncommunicating provers convince a randomizing polynomial time verifier in polynomial time that the input z belongs
PERCEIVED ANIMATE MOTION BY SIMPLE DETERMINISTIC RULES OF INTEROBJECT BEHAVIOUR
, 1987
"... This thesis describes the use of behaviour functions to create systems of graphic objects that appear to be behaving purposefully. These functions determine the motion of an object based on the positions and velocities of all the objects in its environment. A mathematical framework is presented that ..."
Abstract
 Add to MetaCart
that relates classes of rules to the type of behaviour the objects are perceived to take on. Functions using just the positions of objects at the previous time interval can model pushing, pulling, approaching, retreating and tendency to maintain distance. When the second preceding timestep is used, several
Adaptive timestepping for . . .
, 2008
"... Even the simplest advectiondiffusion problems can exhibit multiple time scales. This means that robust variable step time integrators are a prerequisite if such problems are to be efficiently solved computationally. The performance of the second order trapezoid rule using an explicit Adams–Bashfor ..."
Abstract
 Add to MetaCart
Even the simplest advectiondiffusion problems can exhibit multiple time scales. This means that robust variable step time integrators are a prerequisite if such problems are to be efficiently solved computationally. The performance of the second order trapezoid rule using an explicit Adams
Symplectic TimeStepping for Particle Methods
, 2004
"... This paper surveys some of the fundamental properties of symplectic integration schemes for classical mechanics and particle methods in particular. The widely used StörmerVerlet method is discussed in detail and implications of conservation of symplecticity on long term simulations are outlined. Th ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
. The second part of the paper describes the application of a Lagrangian particle method and the StörmerVerlet time integrator to numerical weather prediction (NWP). A simple vertical slice model and nonhydrostatic flow over orography are discussed in detail.
Results 1  10
of
8,891