1028 search results - page 109 / 206 » Measuring Distributional Similarity in Context |
CC
2002
Springer
13 years 8 months ago
2002
Springer
Global variable promotion, i.e. allocating unaliased globals to registers, can significantly reduce the number of memory operations. This results in reduced cache activity and less...
ICPR
2004
IEEE
14 years 10 months ago
2004
IEEE
Graph edit distance provides an error-tolerant way to measure distances between attributed graphs. The effectiveness of edit distance based graph classification algorithms relies ...
KDD
2001
ACM
14 years 9 months ago
2001
ACM
We consider prediction-model evaluation in the context of marketing-campaign planning. In order to evaluate and compare models with specific campaign objectives in mind, we need t...
ALT
2005
Springer
2005
Springer
PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance
14 years 5 months ago
We consider the problem of PAC-learning distributions over strings, represented by probabilistic deterministic finite automata (PDFAs). PDFAs are a probabilistic model for the gen...
HPCA
2006
IEEE
14 years 2 months ago
2006
IEEE
Performance of multithreaded programs is heavily influenced by the latencies of the thread management and synchronization operations. Improving these latencies becomes especially...