Sciweavers

11066 search results - page 1834 / 2214
» Linearity in Process Languages
Sort
View
ICDAR
2011
IEEE
14 years 6 months ago
Automatic Estimation of the Legibility of Binarised Historic Documents for Unsupervised Parameter Tuning
—Document enhancement tools are a valuable help in the study of historic documents. Given proper filter settings, many effects that impair the legibility can be evened out (e.g....
Martin Stommel, G. Frieder
SIGSOFT
2007
ACM
16 years 7 months ago
The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...
SIGSOFT
2007
ACM
16 years 7 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
ICDT
2009
ACM
128views Database» more  ICDT 2009»
16 years 7 months ago
Efficient asymmetric inclusion between regular expression types
The inclusion of Regular Expressions (REs) is the kernel of any type-checking algorithm for XML manipulation languages. XML applications would benefit from the extension of REs wi...
Dario Colazzo, Giorgio Ghelli, Carlo Sartiani
PPOPP
2009
ACM
16 years 7 months ago
Compiler-assisted dynamic scheduling for effective parallelization of loop nests on multicore processors
Recent advances in polyhedral compilation technology have made it feasible to automatically transform affine sequential loop nests for tiled parallel execution on multi-core proce...
Muthu Manikandan Baskaran, Nagavijayalakshmi Vydya...
« Prev « First page 1834 / 2214 Last » Next »