Sciweavers

63 search results - page 8 / 13
» Minimizing NFA's and Regular Expressions
Sort
View
TCSV
2008
87views more  TCSV 2008»
13 years 8 months ago
On Iterative Regularization and Its Application
Many existing techniques for image restoration can be expressed in terms of minimizing a particular cost function. Iterative regularization methods are a novel variation on this th...
Michael R. Charest, Peyman Milanfar
TIP
2008
104views more  TIP 2008»
13 years 8 months ago
A Fast Thresholded Landweber Algorithm for Wavelet-Regularized Multidimensional Deconvolution
We present a fast variational deconvolution algorithm that minimizes a quadratic data term subject to a regularization on the 1 -norm of the wavelet coefficients of the solution. ...
Cédric Vonesch, Michael Unser
CORR
2009
Springer
115views Education» more  CORR 2009»
13 years 6 months ago
Testing the Equivalence of Regular Languages
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
Marco Almeida, Nelma Moreira, Rogério Reis
LCR
1998
Springer
109views System Software» more  LCR 1998»
14 years 23 days ago
Expressing Irregular Computations in Modern Fortran Dialects
Abstract. Modern dialects of Fortran enjoy wide use and good support on highperformance computers as performance-oriented programming languages. By providing the ability to express...
Jan Prins, Siddhartha Chatterjee, Martin Simons
POPL
2004
ACM
14 years 9 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford