Sciweavers

13603 search results - page 409 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
ISAAC
2001
Springer
98views Algorithms» more  ISAAC 2001»
16 years 4 days ago
Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
Hideaki Hori, Shinichi Shimozono, Masayuki Takeda,...
ICIP
2007
IEEE
16 years 9 months ago
Analysis of the Decoding-Complexity of Compressed Image-Based Scene Representations
Interactive navigation in image-based scenes requires random access to the compressed reference image data. When using state of the art block-based hybrid video coding techniques,...
Ingo Bauermann, Eckehard G. Steinbach
ICIP
2003
IEEE
16 years 9 months ago
PDE-based denoising of complex scenes using a spatially-varying fidelity term
The widely used denoising algorithms based on nonlinear diffusion, such as Perona-Malik and total variation denoising, modify images toward piecewise constant functions. Though ed...
Guy Gilboa, Yehoshua Y. Zeevi, Nir A. Sochen
LICS
2007
IEEE
16 years 2 months ago
Light Logics and Optimal Reduction: Completeness and Complexity
Typing of lambda-terms in Elementary and Light Affine Logic (EAL , LAL resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL ...
Patrick Baillot, Paolo Coppola, Ugo Dal Lago
FOSSACS
2007
Springer
16 years 1 months ago
Complexity Results on Balanced Context-Free Languages
Abstract. Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such ...
Akihiko Tozawa, Yasuhiko Minamide