50 search results - page 9 / 10 » Language Compression and Pseudorandom Generators |
108
click to vote
IPPS
2002
IEEE
15 years 4 months ago
2002
IEEE
Short vector SIMD instructions on recent microprocessors, such as SSE on Pentium III and 4, speed up code but are a major challenge to software developers. We present a compiler t...
122
click to vote
CASES
2007
ACM
15 years 3 months ago
2007
ACM
Dynamic binary translation (DBT) has been used to achieve numerous goals (e.g., better performance) for general-purpose computers. Recently, DBT has also attracted attention for e...
WSC
2008
15 years 1 months ago
2008
Most discrete event simulation frameworks are able to output simulation runs as a trace. The Network Simulator 2 (NS2) is a prominent example that does so to decouple generation o...
NIPS
2004
15 years 1 months ago
2004
Prediction suffix trees (PST) provide a popular and effective tool for tasks such as compression, classification, and language modeling. In this paper we take a decision theoretic...
TSD
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Evaluation is one of the hardest tasks in automatic text summarization. It is perhaps even harder to determine how much a particular component of a summarization system c...