Sciweavers

18306 search results - page 311 / 3662
» Algorithmics in Exponential Time
Sort
View
SIGIR
2011
ACM
14 years 9 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...
EDBT
2004
ACM
147views Database» more  EDBT 2004»
16 years 6 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
ATVA
2006
Springer
131views Hardware» more  ATVA 2006»
15 years 10 months ago
Timed Unfoldings for Networks of Timed Automata
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here...
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynie...
RTAS
2008
IEEE
16 years 1 months ago
Using Trace Scratchpads to Reduce Execution Times in Predictable Real-Time Architectures
Instruction scratchpads have been previously suggested as a way to reduce the worst case execution time (WCET) of hard real-time programs without introducing the analysis issues p...
Jack Whitham, Neil C. Audsley
IPPS
2007
IEEE
16 years 1 months ago
A Survey of Worst-Case Execution Time Analysis for Real-Time Java
As real-time systems become more prevalent, there is a need to guarantee that these increasingly complex systems perform as designed. One technique involves a static analysis to p...
Trevor Harmon, Raymond Klefstad