Sciweavers

2475 search results - page 483 / 495
» On the accuracy of language trees
Sort
View
ENTCS
2007
168views more  ENTCS 2007»
13 years 7 months ago
Bytecode Rewriting in Tom
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
Emilie Balland, Pierre-Etienne Moreau, Antoine Rei...
TASLP
2008
201views more  TASLP 2008»
13 years 7 months ago
Syntactically Lexicalized Phrase-Based SMT
Abstract--Until quite recently, extending Phrase-based Statistical Machine Translation (PBSMT) with syntactic knowledge caused system performance to deteriorate. The most recent su...
Hany Hassan, Khalil Sima'an, Andy Way
ASE
2005
137views more  ASE 2005»
13 years 7 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
JCB
2007
136views more  JCB 2007»
13 years 7 months ago
A Structure-Based Flexible Search Method for Motifs in RNA
The discovery of non-coding RNA (ncRNA) motifs and their role in regulating gene expression has recently attracted considerable attention. The goal is to discover these motifs in ...
Isana Veksler-Lublinsky, Michal Ziv-Ukelson, Danny...
CONCURRENCY
2000
133views more  CONCURRENCY 2000»
13 years 7 months ago
OpenMP versus threading in C/C++
When comparing OpenMP to other parallel programming models, it is easier to choose between OpenMP and MPI than between OpenMP and POSIX Threads (Pthreads). With languages like C a...
Bob Kuhn, Paul Petersen, Eamonn O'Toole