Sciweavers

270 search results - page 9 / 54
» A Simple and General Theoretical Account for Abstract Types
Sort
View
ICA
2010
Springer
13 years 6 months ago
Second Order Subspace Analysis and Simple Decompositions
Abstract. The recovery of the mixture of an N-dimensional signal generated by N independent processes is a well studied problem (see e.g. [1,10]) and robust algorithms that solve t...
Harold W. Gutch, Takanori Maehara, Fabian J. Theis
CSDA
2007
136views more  CSDA 2007»
13 years 7 months ago
A note on iterative marginal optimization: a simple algorithm for maximum rank correlation estimation
The maximum rank correlation (MRC) estimator was originally studied by Han [1987. Nonparametric analysis of a generalized regression model. J. Econometrics 35, 303–316] and Sher...
Hansheng Wang
ER
2004
Springer
104views Database» more  ER 2004»
14 years 1 months ago
Incremental Navigation: Providing Simple and Generic Access to Heterogeneous Structures
Abstract. We present an approach to support incremental navigation of structured information, where the structure is introduced by the data model and schema (if present) of a data ...
Shawn Bowers, Lois M. L. Delcambre
TLCA
2005
Springer
14 years 1 months ago
The Elimination of Nesting in SPCF
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
James Laird
ICFP
2010
ACM
13 years 8 months ago
Parametricity and dependent types
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
Jean-Philippe Bernardy, Patrik Jansson, Ross Pater...