Sciweavers

705 search results - page 37 / 141
» New Compilation Languages Based on Structured Decomposabilit...
Sort
View
IFL
2003
Springer
128views Formal Methods» more  IFL 2003»
15 years 3 months ago
With-Loop Scalarization - Merging Nested Array Operations
Construction of complex array operations by composition of more basic ones allows for abstract and concise specifications of algorithms. Unfortunately, na¨ıve compilation of suc...
Clemens Grelck, Sven-Bodo Scholz, Kai Trojahner
PLDI
2006
ACM
15 years 3 months ago
Automatic instruction scheduler retargeting by reverse-engineering
In order to generate high-quality code for modern processors, a compiler must aggressively schedule instructions, maximizing resource utilization for execution efficiency. For a ...
Matthew J. Bridges, Neil Vachharajani, Guilherme O...
FM
2008
Springer
137views Formal Methods» more  FM 2008»
14 years 11 months ago
JML Runtime Assertion Checking: Improved Error Reporting and Efficiency Using Strong Validity
Abstract. The Java Modeling Language (JML) recently switched to an assertion semantics based on "strong validity" in which an assertion is taken to be valid precisely whe...
Patrice Chalin, Frédéric Rioux
JMLR
2008
110views more  JMLR 2008»
14 years 9 months ago
Cross-Validation Optimization for Large Scale Structured Classification Kernel Methods
We propose a highly efficient framework for penalized likelihood kernel methods applied to multiclass models with a large, structured set of classes. As opposed to many previous a...
Matthias W. Seeger
EMNLP
2010
14 years 7 months ago
Efficient Graph-Based Semi-Supervised Learning of Structured Tagging Models
We describe a new scalable algorithm for semi-supervised training of conditional random fields (CRF) and its application to partof-speech (POS) tagging. The algorithm uses a simil...
Amarnag Subramanya, Slav Petrov, Fernando Pereira