Sciweavers

358 search results - page 41 / 72
» Rank Matrix Factorisation
Sort
View
TWC
2010
14 years 5 months ago
Maximum-likelihood noncoherent OSTBC detection with polynomial complexity
Abstract--We prove that maximum-likelihood (ML) noncoherent sequence detection of orthogonal space-time block coded signals can always be performed in polynomial time with respect ...
Dimitris S. Papailiopoulos, George N. Karystinos
125
Voted
COCO
2000
Springer
161views Algorithms» more  COCO 2000»
15 years 3 months ago
Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
Ronald de Wolf
89
Voted
FINTAL
2006
15 years 2 months ago
Language Independent Answer Prediction from the Web
This work presents a strategy that aims to extract and rank predicted answers from the web based on the eigenvalues of a specially designed matrix. This matrix models the strength ...
Alejandro Figueroa, Günter Neumann
94
Voted
IJCAI
2001
15 years 9 days ago
Link Analysis, Eigenvectors and Stability
The HITS and the PageRank algorithms are eigenvector methods for identifying "authoritative" or "influential" articles, given hyperlink or citation information...
Andrew Y. Ng, Alice X. Zheng, Michael I. Jordan
ICASSP
2011
IEEE
14 years 2 months ago
Multi-rank processing for passive ranging in underwater acoustic environments subject to spatial coherence loss
In this work we derive the maximum likelihood estimator for passive wavefront curvature ranging systems operating in environments subject to a spatial coherence loss. As a consequ...
Hongya Ge, Ivars P. Kirsteins