Results 1  10
of
5,956
New developments in closedform computation for GSPN aggregation
 In 5th Int. Conference on Formal Engineering Methods (ICFEM) 2003
, 2003
"... Abstract. Petri nets are useful for modelling complex concurrent systems. While modelling using Petri nets focusses on local states and actions, the analysis methods are concerned with global states and their transitions. Unfortunately generation of the complete state space suffers from the wellkno ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
to aggregate transitions with markingdependent firing rates are presented. Successive aggregation becomes possible to transform very complex models into models in which either a closedform computation of the stationary state distribution is available or which has a very small state space. A prototype
A closedform solution for options with stochastic volatility with applications to bond and currency options
 Review of Financial Studies
, 1993
"... I use a new technique to derive a closedform solution for the price of a European call option on an asset with stochastic volatility. The model allows arbitrary correlation between volatility and spotasset returns. I introduce stochastic interest rates and show how to apply the model to bond option ..."
Abstract

Cited by 1512 (6 self)
 Add to MetaCart
I use a new technique to derive a closedform solution for the price of a European call option on an asset with stochastic volatility. The model allows arbitrary correlation between volatility and spotasset returns. I introduce stochastic interest rates and show how to apply the model to bond
ClosedForm Token Distribution Computation of GSPNs Without
"... In this paper we present a new technique for analysing a class of Generalised Stochastic Petri Nets (GSPNs) while avoiding state space generation. The structure of the class of GSPNs, which is used here, is restricted in that no synchronising transitions are allowed. In recent publications we presen ..."
Abstract
 Add to MetaCart
alternative structures. For these cases a closedform computation of the aggregated GSPN model was impossible. In this paper we present a solution overcoming this problem.
Understanding Normal and Impaired Word Reading: Computational Principles in QuasiRegular Domains
 PSYCHOLOGICAL REVIEW
, 1996
"... We develop a connectionist approach to processing in quasiregular domains, as exemplified by English word reading. A consideration of the shortcomings of a previous implementation (Seidenberg & McClelland, 1989, Psych. Rev.) in reading nonwords leads to the development of orthographic and phono ..."
Abstract

Cited by 613 (94 self)
 Add to MetaCart
and phonological representations that capture better the relevant structure among the written and spoken forms of words. In a number of simulation experiments, networks using the new representations learn to read both regular and exception words, including lowfrequency exception words, and yet are still able
Flexible camera calibration by viewing a plane from unknown orientations
, 1999
"... We propose a flexible new technique to easily calibrate a camera. It only requires the camera to observe a planar pattern shown at a few (at least two) different orientations. Either the camera or the planar pattern can be freely moved. The motion need not be known. Radial lens distortion is modeled ..."
Abstract

Cited by 511 (7 self)
 Add to MetaCart
is modeled. The proposed procedure consists of a closedform solution, followed by a nonlinear refinement based on the maximum likelihood criterion. Both computer simulation and real data have been used to test the proposed technique, and very good results have been obtained. Compared with classical
A randomized protocol for signing contracts
, 1990
"... Two parties, A and B, want to sign a contract C over a communication network. To do so, they must “simultaneously” exchange their commitments to C. Since simultaneous exchange is usually impossible in practice, protocols are needed to approximate simultaneity by exchanging partial commitments in pie ..."
Abstract

Cited by 599 (11 self)
 Add to MetaCart
commit both parties to the contract given that the other party can, is close to zero. This is true even if A and B have vastly different computing powers, and is proved under very weak cryptographic assumptions. Our protocol has the following additional properties: 4 during the procedure the parties
Virtual time and global states of distributed systems.
 Proc. Workshop on Parallel and Distributed Algorithms,
, 1989
"... Abstract A distributed system can be characterized by the fact that the global state is distributed and that a common time base does not exist. However, the notion of time is an important concept in every day life of our decentralized \ r eal world" and helps to solve problems like getting a c ..."
Abstract

Cited by 744 (5 self)
 Add to MetaCart
artially ordered a n d form a lattice. By using timestamps and a simple clock update mechanism the structure o f c ausality is represented in an isomorphic way. The new model of time has a close analogy to Minkowski's relativistic spacetime and leads among others to an interesting characterization
Typesetting Concrete Mathematics
 TUGBOAT
, 1989
"... ... tried my best to make the book mathematically interesting, but I also knew that it would be typographically interestingbecause it would be the first major use of a new typeface by Hermann Zapf, commissioned by the American Mathematical Society. This typeface, called AMS Euler, had been carefull ..."
Abstract

Cited by 661 (1 self)
 Add to MetaCart
carefully digitized and put into METAFONT form by Stanford's digital typography students [a]; but it had not yet been "tuned up " for real applications. My new book served as an ideal test case, because (1) it involved a great variety of mathematical formulas; (2) I was highly motivated
An Efficient Solution to the FivePoint Relative Pose Problem
, 2004
"... An efficient algorithmic solution to the classical fivepoint relative pose problem is presented. The problem is to find the possible solutions for relative camera pose between two calibrated views given five corresponding points. The algorithm consists of computing the coefficients of a tenth degre ..."
Abstract

Cited by 484 (13 self)
 Add to MetaCart
degree polynomial in closed form and subsequently finding its roots. It is the first algorithm well suited for numerical implementation that also corresponds to the inherent complexity of the problem. We investigate the numerical precision of the algorithm. We also study its performance under noise
A ClosedForm Solution to Natural Image Matting
 IEEE TRANS. PAMI
, 2008
"... Interactive digital matting, the process of extracting a foreground object from an image based on limited user input, is an important task in image and video editing. From a computer vision perspective, this task is extremely challenging because it is massively illposed—at each pixel we must estim ..."
Abstract

Cited by 136 (2 self)
 Add to MetaCart
, or perform iterative nonlinear estimation by alternating foreground and background color estimation with alpha estimation. In this paper, we present a closedform solution to natural image matting. We derive a cost function from local smoothness assumptions on foreground and background colors and show
Results 1  10
of
5,956