Sciweavers

16430 search results - page 2948 / 3286
» On Computable Tree Functions
Sort
View
176
Voted
CSDA
2008
115views more  CSDA 2008»
15 years 6 months ago
Complex-valued ICA based on a pair of generalized covariance matrices
It is shown that any pair of scatter and spatial scatter matrices yields an estimator of the separating matrix for complex-valued independent component analysis (ICA). Scatter (re...
Esa Ollila, Hannu Oja, Visa Koivunen
CSDA
2008
94views more  CSDA 2008»
15 years 6 months ago
Robust model selection using fast and robust bootstrap
Robust model selection procedures control the undue influence that outliers can have on the selection criteria by using both robust point estimators and a bounded loss function wh...
Matias Salibian-Barrera, Stefan Van Aelst
ECCC
2008
108views more  ECCC 2008»
15 years 6 months ago
The Complexity of Rationalizing Matchings
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
Shankar Kalyanaraman, Christopher Umans
AIL
2006
84views more  AIL 2006»
15 years 6 months ago
Meaningful electronic signatures based on an automatic indexing method
Legal information certification and secured storage combined with documents electronic signature are of great interest when digital documents security and conservation are in conce...
Maxime Wack, Ahmed Nait-Sidi-Moh, Sid Lamrous, Nat...
ENGL
2008
79views more  ENGL 2008»
15 years 6 months ago
Cost Reduction in Nearest Neighbour Based Synthesis of Quantum Boolean Circuits
Quantum computer algorithms require an `oracle' as an integral part. An oracle is a reversible quantum Boolean circuit, where the inputs are kept unchanged at the outputs and ...
Mozammel H. A. Khan
« Prev « First page 2948 / 3286 Last » Next »