Sciweavers

4315 search results - page 862 / 863
» Sorting in linear time
Sort
View
SIGIR
2011
ACM
12 years 10 months ago
Fast context-aware recommendations with factorization machines
The situation in which a choice is made is an important information for recommender systems. Context-aware recommenders take this information into account to make predictions. So ...
Steffen Rendle, Zeno Gantner, Christoph Freudentha...
SIGMOD
2011
ACM
158views Database» more  SIGMOD 2011»
12 years 10 months ago
Workload-aware database monitoring and consolidation
In most enterprises, databases are deployed on dedicated database servers. Often, these servers are underutilized much of the time. For example, in traces from almost 200 producti...
Carlo Curino, Evan P. C. Jones, Samuel Madden, Har...
CRYPTO
2011
Springer
243views Cryptology» more  CRYPTO 2011»
12 years 7 months ago
Memory Delegation
We consider the problem of delegating computation, where the delegator doesn’t even know the input to the function being delegated, and runs in time significantly smaller than ...
Kai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu, Ra...
TOG
2012
297views Communications» more  TOG 2012»
11 years 10 months ago
Adaptive manifolds for real-time high-dimensional filtering
We present a technique for performing high-dimensional filtering of images and videos in real time. Our approach produces high-quality results and accelerates filtering by compu...
Eduardo S. L. Gastal, Manuel M. Oliveira
KDD
2012
ACM
221views Data Mining» more  KDD 2012»
11 years 10 months ago
Fast mining and forecasting of complex time-stamped events
Given huge collections of time-evolving events such as web-click logs, which consist of multiple attributes (e.g., URL, userID, timestamp), how do we find patterns and trends? Ho...
Yasuko Matsubara, Yasushi Sakurai, Christos Falout...