Sciweavers

2018 search results - page 197 / 404
» Magnitude-preserving ranking algorithms
Sort
View
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
13 years 9 months ago
Online learning to diversify from implicit feedback
In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these dive...
Karthik Raman, Pannaga Shivaswamy, Thorsten Joachi...
CVPR
2012
IEEE
13 years 9 months ago
Changedetection.net: A new change detection benchmark dataset
Change detection is one of the most commonly encountered low-level tasks in computer vision and video processing. A plethora of algorithms have been developed to date, yet no wide...
Nil Goyette, Pierre-Marc Jodoin, Fatih Porikli, Ja...
ISSAC
2004
Springer
102views Mathematics» more  ISSAC 2004»
15 years 11 months ago
FFPACK: finite field linear algebra package
The FFLAS project has established that exact matrix multiplication over finite fields can be performed at the speed of the highly optimized numerical BLAS routines. Since many a...
Jean-Guillaume Dumas, Pascal Giorgi, Clémen...
VLDB
2004
ACM
161views Database» more  VLDB 2004»
16 years 6 months ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid
CIKM
2009
Springer
16 years 1 months ago
P-Rank: a comprehensive structural similarity measure over information networks
With the ubiquity of information networks and their broad applications, the issue of similarity computation between entities of an information network arises and draws extensive r...
Peixiang Zhao, Jiawei Han, Yizhou Sun