Sciweavers

2714 search results - page 328 / 543
» Approximation Schemes for Scheduling
Sort
View
120
Voted
CORR
2006
Springer
81views Education» more  CORR 2006»
15 years 3 months ago
Universal Filtering via Hidden Markov Modeling
The problem of discrete universal filtering, in which the components of a discrete signal emitted by an unknown source and corrupted by a known discrete memoryless channel (DMC) ar...
Taesup Moon, Tsachy Weissman
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
15 years 3 months ago
The Euclidean Orienteering Problem Revisited
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
Ke Chen 0006, Sariel Har-Peled
AUTOMATICA
2011
14 years 11 months ago
A frequentist approach to mapping under uncertainty
An asynchronous stochastic approximation based (Frequentist) approach is proposed for mapping using noisy mobile sensors under two different scenarios: 1) perfectly known sensor ...
Suman Chakravorty, R. Saha
160
Voted
DCC
2011
IEEE
14 years 10 months ago
Accurate estimates of the data complexity and success probability for various cryptanalyses
Abstract Many attacks on encryption schemes rely on statistical considerations using plaintext/ciphertext pairs to find some information on the key. We provide here simple formula...
Céline Blondeau, Benoît Gérard...
JMIV
2010
107views more  JMIV 2010»
14 years 10 months ago
Block Based Deconvolution Algorithm Using Spline Wavelet Packets
This paper proposes robust algorithms to deconvolve discrete noised signals and images. The solutions are derived as linear combinations of spline wavelet packets that minimize so...
Amir Averbuch, Valery A. Zheludev, Pekka Neittaanm...