Sciweavers

50 search results - page 9 / 10
» Language Compression and Pseudorandom Generators
Sort
View
IPPS
2002
IEEE
13 years 11 months ago
A SIMD Vectorizing Compiler for Digital Signal Processing Algorithms
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...
Franz Franchetti, Markus Püschel
CASES
2007
ACM
13 years 10 months ago
Fragment cache management for dynamic binary translators in embedded systems with scratchpad
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...
José Baiocchi, Bruce R. Childers, Jack W. D...
WSC
2008
13 years 8 months ago
Phrase based browsing for simulation traces of network protocols
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...
Nathan J. Schmidt, Peter Kemper
NIPS
2004
13 years 7 months ago
The Power of Selective Memory: Self-Bounded Learning of Prediction Suffix Trees
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...
Ofer Dekel, Shai Shalev-Shwartz, Yoram Singer
TSD
2010
Springer
13 years 4 months ago
Evaluation of a Sentence Ranker for Text Summarization Based on Roget's Thesaurus
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...
Alistair Kennedy, Stan Szpakowicz