Sciweavers

174 search results - page 20 / 35
» Fast equation automaton computation
Sort
View
SCALESPACE
2009
Springer
15 years 6 months ago
An Edge-Preserving Multilevel Method for Deblurring, Denoising, and Segmentation
We present a fast edge-preserving cascadic multilevel image restoration method for reducing blur and noise in contaminated images. The method also can be applied to segmentation. O...
Serena Morigi, Lothar Reichel, Fiorella Sgallari
EGH
2003
Springer
15 years 5 months ago
A multigrid solver for boundary value problems using programmable graphics hardware
—We present a method for using programmable graphics hardware to solve a variety of boundary value problems. The time-evolution of such problems is frequently governed by partial...
Nolan Goodnight, Cliff Woolley, Gregory Lewin, Dav...
ATVA
2005
Springer
132views Hardware» more  ATVA 2005»
15 years 5 months ago
Flat Counter Automata Almost Everywhere!
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
Jérôme Leroux, Grégoire Sutre
CGO
2008
IEEE
15 years 6 months ago
Fast liveness checking for ssa-form programs
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
Benoit Boissinot, Sebastian Hack, Daniel Grund, Be...
JMLR
2006
389views more  JMLR 2006»
14 years 11 months ago
A Very Fast Learning Method for Neural Networks Based on Sensitivity Analysis
This paper introduces a learning method for two-layer feedforward neural networks based on sensitivity analysis, which uses a linear training algorithm for each of the two layers....
Enrique Castillo, Bertha Guijarro-Berdiñas,...