4581 search results - page 509 / 917 » Computing Transformation Semigroups |
205
click to vote
BIRTHDAY
2010
Springer
15 years 4 months ago
2010
Springer
To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all possible runs of the program. Afterwards, the graph can...
180
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
This work presents the first extensive study of singlenode performance optimization, tuning, and analysis of the fast multipole method (FMM) on modern multicore systems. We consid...
176
click to vote
NAACL
2010
15 years 4 months ago
2010
This paper describes a method for checking the acceptability of paraphrases in context. We use the Google n-gram data and a CCG parser to certify the paraphrasing grammaticality a...
176
click to vote
NAACL
2010
15 years 4 months ago
2010
We describe tree edit models for representing sequences of tree transformations involving complex reordering phenomena and demonstrate that they offer a simple, intuitive, and eff...
158
click to vote
NAACL
2010
15 years 4 months ago
2010
We suggest improvements to a previously proposed framework for integrating Conditional Random Fields and Hidden Markov Models, dubbed a Crandem system (2009). The previous authors...