2107 search results - page 330 / 422 » Computing Small Search Numbers in Linear Time |
RECSYS
2009
ACM
14 years 3 months ago
2009
ACM
In the Netflix Prize competition many new collaborative filtering (CF) approaches emerged, which are excellent in optimizing the RMSE of the predictions. Matrix factorization (M...
MIR
2005
ACM
14 years 2 months ago
2005
ACM
In this paper, we will propose a novel semi-automatic annotation scheme for video semantic classification. It is well known that the large gap between high-level semantics and low...
SIGMETRICS
2004
ACM
14 years 2 months ago
2004
ACM
Traditional Peer-to-Peer (P2P) networks do not provide service differentiation and incentive for users. Consequently, users can easily access information without contributing any ...
CASES
2003
ACM
14 years 2 months ago
2003
ACM
Bank locality can be defined as localizing the number of load/store accesses to a small set of memory banks at a given time. An optimizing compiler can modify a given input code t...
ESA
2010
Springer
13 years 10 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...