741 search results - page 127 / 149 » Memory Dependence Prediction Using Store Sets |
179
click to vote
SIGMOD
2002
ACM
16 years 2 months ago
2002
ACM
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
134
click to vote
JSA
2000
15 years 1 months ago
2000
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
135
click to vote
STACS
2007
Springer
15 years 8 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
135
Voted
CIKM
2004
Springer
15 years 7 months ago
2004
Springer
Modern corporations operate in an extremely complex environment and strongly depend on all kinds of information resources across the enterprise. Unfortunately, with the growth of ...
122
click to vote
KDD
2009
ACM
16 years 2 months ago
2009
ACM
Search queries are typically very short, which means they are often underspecified or have senses that the user did not think of. A broad latent query aspect is a set of keywords ...