Sciweavers

923 search results - page 60 / 185
» Factorizing Languages
Sort
View
PLDI
2003
ACM
15 years 5 months ago
Optimizing indirect branch prediction accuracy in virtual machine interpreters
Interpreters designed for efficiency execute a huge number of indirect branches and can spend more than half of the execution time in indirect branch mispredictions. Branch target...
M. Anton Ertl, David Gregg
ITA
2007
118views Communications» more  ITA 2007»
14 years 11 months ago
Uniformly bounded duplication codes
Duplication is the replacement of a factor w within a word by ww. This operation can be used iteratively to generate languages starting from words or sets of words. By undoing dupl...
Peter Leupold, Victor Mitrana
JOT
2002
52views more  JOT 2002»
14 years 11 months ago
Negotiable Interfaces for Components
es are extended with a factorable, abstract state, and methods of interfaces are extended with state transformation behaviours. A new programming language command, the USE statemen...
Simon D. Kent, Chris Ho-Stuart, Paul Roe
EMNLP
2009
14 years 9 months ago
Person Cross Document Coreference with Name Perplexity Estimates
The Person Cross Document Coreference systems depend on the context for making decisions on the possible coreferences between person name mentions. The amount of context required ...
Octavian Popescu
ISAAC
2003
Springer
133views Algorithms» more  ISAAC 2003»
15 years 5 months ago
The Intractability of Computing the Hamming Distance
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
Bodo Manthey, Rüdiger Reischuk