Sciweavers

5435 search results - page 22 / 1087
» Informed Detection Revisited
Sort
View
CAI
2007
Springer
14 years 3 months ago
Learning Deterministically Recognizable Tree Series - Revisited
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
Andreas Maletti
FORMATS
2007
Springer
14 years 3 months ago
Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
Sergio Giro, Pedro R. D'Argenio
CORR
2006
Springer
66views Education» more  CORR 2006»
13 years 9 months ago
MDL Denoising Revisited
We refine and extend an earlier MDL denoising criterion for wavelet-based denoising. We start by showing that the denoising problem can be reformulated as a clustering problem, whe...
Teemu Roos, Petri Myllymäki, Jorma Rissanen
IJNSEC
2008
92views more  IJNSEC 2008»
13 years 9 months ago
Re-visiting the One-Time Pad
In 1949, Shannon proved the perfect secrecy of the Vernam cryptographic system (One-Time Pad or OTP). It has generally been believed that the perfectly random and uncompressible O...
Nithin Nagaraj, Vivek Vaidya, Prabhakar G. Vaidya
PR
2006
107views more  PR 2006»
13 years 9 months ago
Pyramid segmentation algorithms revisited
The main goal of this work is to compare pyramidal structures proposed to solve segmentation tasks. Segmentation algorithms based on regular and irregular pyramids are described, ...
Rebeca Marfil, Luis Molina-Tanco, Antonio Bandera,...