Sciweavers

3819 search results - page 630 / 764
» Simple Easy Terms
Sort
View
CORR
2010
Springer
169views Education» more  CORR 2010»
13 years 4 months ago
Recommender Systems by means of Information Retrieval
In this paper we present a method for reformulating the Recommender Systems problem in an Information Retrieval one. In our tests we have a dataset of users who give ratings for s...
Alberto Costa, Fabio Roda
ISCA
2011
IEEE
270views Hardware» more  ISCA 2011»
13 years 1 months ago
Sampling + DMR: practical and low-overhead permanent fault detection
With technology scaling, manufacture-time and in-field permanent faults are becoming a fundamental problem. Multi-core architectures with spares can tolerate them by detecting an...
Shuou Nomura, Matthew D. Sinclair, Chen-Han Ho, Ve...
SIGIR
2011
ACM
13 years 1 months ago
Faster top-k document retrieval using block-max indexes
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
Shuai Ding, Torsten Suel
SIGMOD
2011
ACM
297views Database» more  SIGMOD 2011»
13 years 1 months ago
Apples and oranges: a comparison of RDF benchmarks and real RDF datasets
The widespread adoption of the Resource Description Framework (RDF) for the representation of both open web and enterprise data is the driving force behind the increasing research...
Songyun Duan, Anastasios Kementsietsidis, Kavitha ...
CORR
2012
Springer
249views Education» more  CORR 2012»
12 years 6 months ago
Computing Cartograms with Optimal Complexity
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
Md. Jawaherul Alam, Therese C. Biedl, Stefan Felsn...