Sciweavers

205 search results - page 11 / 41
» An Alternative Ranking Problem for Search Engines
Sort
View
ISAAC
2003
Springer
104views Algorithms» more  ISAAC 2003»
14 years 20 days ago
Deterministic Algorithm for the t-Threshold Set Problem
Given k sorted arrays, the t-Threshold problem, which is motivated by indexed search engines, consists of finding the elements which are present in at least t of the arrays. We pr...
Jérémy Barbay, Claire Kenyon
IJON
2007
134views more  IJON 2007»
13 years 7 months ago
Analysis of SVM regression bounds for variable ranking
This paper addresses the problem of variable ranking for Support Vector Regression. The relevance criteria that we proposed are based on leave-one-out bounds and some variants and...
Alain Rakotomamonjy
ECML
2005
Springer
14 years 1 months ago
Thwarting the Nigritude Ultramarine: Learning to Identify Link Spam
The page rank of a commercial web site has an enormous economic impact because it directly influences the number of potential customers that find the site as a highly ranked sear...
Isabel Drost, Tobias Scheffer
SIGIR
2010
ACM
13 years 11 months ago
How good is a span of terms?: exploiting proximity to improve web retrieval
Ranking search results is a fundamental problem in information retrieval. In this paper we explore whether the use of proximity and phrase information can improve web retrieval ac...
Krysta Marie Svore, Pallika H. Kanani, Nazan Khan
ICASSP
2010
IEEE
13 years 7 months ago
Simultaneous search for all modes in multilinear models
Parallel factor (PARAFAC) analysis is an extension of a low rank decomposition to higher way arrays, usually called tensors. Most of existing methods are based on an alternating l...
Petr Tichavský, Zbynek Koldovský