Sciweavers

220 search results - page 15 / 44
» Paper Rating vs. Paper Ranking
Sort
View
COCO
2004
Springer
82views Algorithms» more  COCO 2004»
14 years 26 days ago
Dimension, Entropy Rates, and Compression
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
John M. Hitchcock, N. V. Vinodchandran
ACMSE
2010
ACM
13 years 2 months ago
Learning to rank using 1-norm regularization and convex hull reduction
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
Xiaofei Nan, Yixin Chen, Xin Dang, Dawn Wilkins
ICITA
2005
IEEE
14 years 1 months ago
Partition-Based Parallel PageRank Algorithm
A re-ranking technique,called “PageRank brings a successful story behind the search engine. Many studies focus on finding an way to compute the PageRank scores of a large web gr...
Arnon Rungsawang, Bundit Manaskasemsak
CIKM
2009
Springer
14 years 2 months ago
A general magnitude-preserving boosting algorithm for search ranking
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
Chenguang Zhu, Weizhu Chen, Zeyuan Allen Zhu, Gang...
ICASSP
2011
IEEE
12 years 11 months ago
Cooperative spectrum sensing based on matrix rank minimization
In cognitive radio (CR) networks, multi-CR cooperation typically takes place during spectrum sensing, to cope with wireless fading effects and the hidden terminal problem. The use...
Yue Wang, Zhi Tian, Chunyan Feng