Sciweavers

2018 search results - page 171 / 404
» Magnitude-preserving ranking algorithms
Sort
View
COCO
2000
Springer
161views Algorithms» more  COCO 2000»
15 years 10 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
IJCAI
2001
15 years 7 months 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
UAI
2004
15 years 7 months ago
MOB-ESP and other Improvements in Probability Estimation
A key prerequisite to optimal reasoning under uncertainty in intelligent systems is to start with good class probability estimates. This paper improves on the current best probabi...
Rodney Nielsen
ESANN
2000
15 years 7 months ago
Committee formation for reliable and accurate neural prediction in industry
Abstract. This paper describes "cranking", a new committee formation algorithm. Cranking results in accurate and reliable committee predictions, even when applied to comp...
Peter J. Edwards, Alan F. Murray
JCSS
2007
88views more  JCSS 2007»
15 years 6 months ago
Counting lattice vectors
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is â™...
Denis Xavier Charles