162 search results - page 28 / 33 » Parallel frequent set counting |
HPCA
2006
IEEE
14 years 8 months ago
2006
IEEE
Allowing loads to issue out-of-order with respect to earlier unresolved store addresses is very important for extracting parallelism in large-window superscalar processors. Blindl...
SPAA
2003
ACM
14 years 27 days ago
2003
ACM
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...
ICDCS
2012
IEEE
11 years 10 months ago
2012
IEEE
—Name-based route lookup is a key function for Named Data Networking (NDN). The NDN names are hierarchical and have variable and unbounded lengths, which are much longer than IPv...
WDAG
2001
Springer
14 years 2 days ago
2001
Springer
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
LREC
2010
13 years 9 months ago
2010
We have previously reported on ProPOSEL, a purpose-built Prosody and PoS English Lexicon compatible with the Python Natural Language ToolKit. ProPOSEC is a new corpus research res...