Results 1 - 10 of 2,727

Fast and robust fixed-point algorithms for independent component analysis

by Aapo Hyvärinen - IEEE TRANS. NEURAL NETW , 1999
"... Independent component analysis (ICA) is a statistical method for transforming an observed multidimensional random vector into components that are statistically as independent from each other as possible. In this paper, we use a combination of two different approaches for linear ICA: Comon’s informat ..."
Abstract - Cited by 884 (34 self) - Add to MetaCart
Independent component analysis (ICA) is a statistical method for transforming an observed multidimensional random vector into components that are statistically as independent from each other as possible. In this paper, we use a combination of two different approaches for linear ICA: Comon’s

Transform Analysis and Asset Pricing for Affine Jump-Diffusions

by Darrell Duffie, Jun Pan, Kenneth Singleton - Econometrica , 2000
"... In the setting of ‘‘affine’ ’ jump-diffusion state processes, this paper provides an analytical treatment of a class of transforms, including various Laplace and Fourier transforms as special cases, that allow an analytical treatment of a range of valuation and econometric problems. Example applicat ..."
Abstract - Cited by 710 (38 self) - Add to MetaCart
applications include fixed-income pricing models, with a role for intensity-based models of default, as well as a wide range of option-pricing applications. An illustrative example examines the implications of stochastic volatility and jumps for option valuation. This example highlights the impact on option

Fixing the Java memory model

by Jeremy Manson, William Pugh, Sarita V. Adve, Jeremy Manson - In ACM Java Grande Conference , 1999
"... This paper describes the new Java memory model, which has been revised as part of Java 5.0. The model specifies the legal behaviors for a multithreaded program; it defines the semantics of multithreaded Java programs and partially determines legal implementations of Java virtual machines and compile ..."
Abstract - Cited by 385 (10 self) - Add to MetaCart
they rely on a strong notion of data and control dependences that precludes some standard compiler transformations. Although the majority of what is currently done in compilers is legal, the new model introduces significant differences, and clearly defines the boundaries of legal transformations

Kurtev I.: Transforming Models with ATL:

by Frédéric Jouault , Ivan Kurtev - Proceedings of the Model Transformations in Practice Workshop at MoDELS, , 2005
"... Abstract. This paper presents ATL (ATLAS Transformation Language): a hybrid model transformation language that allows both declarative and imperative constructs to be used in transformation definitions. The paper describes the language syntax and semantics by using examples. ATL is supported by a s ..."
Abstract - Cited by 272 (22 self) - Add to MetaCart
Abstract. This paper presents ATL (ATLAS Transformation Language): a hybrid model transformation language that allows both declarative and imperative constructs to be used in transformation definitions. The paper describes the language syntax and semantics by using examples. ATL is supported by a

Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit

by David L. Donoho, Yaakov Tsaig, Iddo Drori, Jean-luc Starck , 2006
"... Finding the sparsest solution to underdetermined systems of linear equations y = Φx is NP-hard in general. We show here that for systems with ‘typical’/‘random ’ Φ, a good approximation to the sparsest solution is obtained by applying a fixed number of standard operations from linear algebra. Our pr ..."
Abstract - Cited by 274 (22 self) - Add to MetaCart
a least-squares problem using the selected coordinates, and subtracts the leastsquares fit, producing a new residual. After a fixed number of stages (e.g. 10), it stops. In contrast to Orthogonal Matching Pursuit (OMP), many coefficients can enter the model at each stage in StOMP while only one

The Alternating Fixpoint of Logic Programs with Negation

by Allen Van Gelder , 1995
"... The alternating fixpoint of a logic program with negation is defined constructively. The underlying idea is monotonically to build up a set of negative conclusions until the least fixpoint is reached, using a transformation related to the one that defines stable models. From a fixed set of negative ..."
Abstract - Cited by 244 (3 self) - Add to MetaCart
The alternating fixpoint of a logic program with negation is defined constructively. The underlying idea is monotonically to build up a set of negative conclusions until the least fixpoint is reached, using a transformation related to the one that defines stable models. From a fixed set of negative

Non-negative matrix factorization for polyphonic music transcription

by Paris Smaragdis, Judith C. Brown - IN PROC. IEEE WORKSHOP APPLICATIONS OF SIGNAL PROCESSING TO AUDIO AND ACOUSTICS , 2003
"... In this paper we present a methodology for analyzing polyphonic musical passages comprised by notes that exhibit a harmonically fixed spectral profile (such as piano notes). Taking advantage of this unique note structure we can model the audio content of the musical passage by a linear basis transfo ..."
Abstract - Cited by 240 (14 self) - Add to MetaCart
In this paper we present a methodology for analyzing polyphonic musical passages comprised by notes that exhibit a harmonically fixed spectral profile (such as piano notes). Taking advantage of this unique note structure we can model the audio content of the musical passage by a linear basis

Orchestrating ATL Model Transformations

by J. E. Rivera, D. Ruiz-gonzález, F. López-romero, J. Bautista, A. Vallecillo - In Jouault [7
"... Abstract. The design and development of any complex applications using a Model-driven Engineering approach involve not only the use of many models, but also the use of many model transformations between them. These transformations should be chained together, using Model Transformation Orchestration ..."
Abstract - Cited by 10 (0 self) - Add to MetaCart
notations and tools. This paper introduces Wires*, a graphical executable language for the orchestration of ATL transformations, which provides appropriate mechanisms to enable the modular and compositional specification and execution of complex model transformations chains. 1

Transforming Models with ATL 1

by Frédéric Jouault, Ivan Kurtev
"... hybrid model transformation language that allows both declarative and imperative constructs to be used in transformation definitions. The paper describes the language syntax by using examples. Language semantics is described in pseudo-code and various optimizations of transformation executions are d ..."
Abstract - Add to MetaCart
hybrid model transformation language that allows both declarative and imperative constructs to be used in transformation definitions. The paper describes the language syntax by using examples. Language semantics is described in pseudo-code and various optimizations of transformation executions

The ATL Transformation-based Model

by Université De Nantes, Groupe Sodifrance, Jean Bézivin, Jean Bézivin, Jean Bézivin, Erwan Breton, Erwan Breton, Grégoire Dupé, Grégoire Dupé, Grégoire Dupé, Patrick Valduriez, Patrick Valduriez, Patrick Valduriez - Management Framework, Research Report, Atlas Group, INRIA and IRIN , 2003
"... Les rapports de recherche de l’Institut de Recherche en Informatique de Nantes sont disponibles aux formats PostScript ® et PDF ® à l’URL: ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Les rapports de recherche de l’Institut de Recherche en Informatique de Nantes sont disponibles aux formats PostScript ® et PDF ® à l’URL:
Results 1 - 10 of 2,727