1203 search results - page 232 / 241 » Probabilistic Matrix Factorization |
103
click to vote
WWW
2007
ACM
16 years 9 days ago
2007
ACM
Determining the user intent of Web searches is a difficult problem due to the sparse data available concerning the searcher. In this paper, we examine a method to determine the us...
STOC
2009
ACM
16 years 7 days ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
HPCA
2009
IEEE
16 years 5 days ago
2009
IEEE
Prior research demonstrates that temporal memory streaming and related address-correlating prefetchers improve performance of commercial server workloads though increased memory l...
102
click to vote
MOBISYS
2009
ACM
16 years 5 days ago
2009
ACM
Establishing trust between a group of individuals remains a difficult problem. Prior works assume trusted infrastructure, require an individual to trust unknown entities, or provi...
161
click to vote
RECOMB
2001
Springer
15 years 12 months ago
2001
Springer
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...