Sciweavers

39 search results - page 6 / 8
» Monotone complexity and the rank of matrices
Sort
View
ICASSP
2011
IEEE
12 years 10 months ago
An efficient rank-deficient computation of the Principle of Relevant Information
One of the main difficulties in computing information theoretic learning (ITL) estimators is the computational complexity that grows quadratically with data. Considerable amount ...
Luis Gonzalo Sánchez Giraldo, José C...
SPIRE
2005
Springer
14 years 5 days ago
Retrieval Status Values in Information Retrieval Evaluation
Retrieval systems rank documents according to their retrieval status values (RSV) if these are monotonously increasing with the probability of relevance of documents. In this work,...
Amélie Imafouo, Xavier Tannier
CVPR
2009
IEEE
15 years 1 months ago
SIFT-Rank: Ordinal Description for Invariant Feature Correspondence
This paper investigates ordinal image description for invariant feature correspondence. Ordinal description is a meta-technique which considers image measurements in terms of th...
Matthew Toews, William M. Wells III
ICC
2007
IEEE
110views Communications» more  ICC 2007»
14 years 1 months ago
A New STC Structure to Achieve Generalized Optimal Diversity with a Reduced Design Complexity
Abstract - We propose a new space-time code (STC) structure that can achieve generalized optimal diversity (GOD) with a reduced design complexity, and also provide an increased cod...
Moon Il Lee, Seong Keun Oh, Dong Seung Kwon
EOR
2007
102views more  EOR 2007»
13 years 6 months ago
Sub-stochastic matrix analysis for bounds computation - Theoretical results
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
Serge Haddad, Patrice Moreaux