Sciweavers

417 search results - page 8 / 84
» Running Time Predictions for Factoring Algorithms
Sort
View
IPPS
1999
IEEE
15 years 1 months ago
The Case for Prediction-Based Best-Effort Real-Time Systems
Abstract. We propose a prediction-based best-effort real-time service to support distributed, interactive applications in shared, unreserved computing environments. These applicati...
Peter A. Dinda, Loukas F. Kallivokas, Bruce Loweka...
ARC
2008
Springer
112views Hardware» more  ARC 2008»
14 years 11 months ago
Optimal Unroll Factor for Reconfigurable Architectures
Abstract. Loops are an important source of optimization. In this paper, we address such optimizations for those cases when loops contain kernels mapped on reconfigurable fabric. We...
Ozana Silvia Dragomir, Elena Moscu Panainte, Koen ...
SIGIR
2011
ACM
14 years 12 days 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...
FOSSACS
2011
Springer
14 years 1 months ago
A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...
Naoki Kobayashi
KDD
2012
ACM
235views Data Mining» more  KDD 2012»
13 years 1 days ago
A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
Ninh Pham, Rasmus Pagh