Sciweavers

2018 search results - page 167 / 404
» Magnitude-preserving ranking algorithms
Sort
View
TIT
2008
115views more  TIT 2008»
15 years 6 months ago
Affine Reflection Group Codes
This paper presents a construction of Slepian group codes from affine reflection groups. The solution to the initial vector and nearest distance problem is presented for all irred...
Terasan Niyomsataya, Ali Miri, Monica Nevins
KDD
2009
ACM
169views Data Mining» more  KDD 2009»
16 years 7 months ago
COA: finding novel patents through text analysis
In recent years, the number of patents filed by the business enterprises in the technology industry are growing rapidly, thus providing unprecedented opportunities for knowledge d...
Mohammad Al Hasan, W. Scott Spangler, Thomas D. Gr...
CIKM
2008
Springer
15 years 8 months ago
Using English information in non-English web search
The leading web search engines have spent a decade building highly specialized ranking functions for English web pages. One of the reasons these ranking functions are effective is...
Wei Gao, John Blitzer, Ming Zhou
BMCBI
2006
118views more  BMCBI 2006»
15 years 6 months ago
Microarray image analysis: background estimation using quantile and morphological filters
Background: In a microarray experiment the difference in expression between genes on the same slide is up to 103 fold or more. At low expression, even a small error in the estimat...
Anders Bengtsson, Henrik Bengtsson
ICML
2003
IEEE
16 years 7 months ago
Learning Distance Functions using Equivalence Relations
We address the problem of learning distance metrics using side-information in the form of groups of "similar" points. We propose to use the RCA algorithm, which is a sim...
Aharon Bar-Hillel, Tomer Hertz, Noam Shental, Daph...