Sciweavers

2924 search results - page 73 / 585
» Lower Bounds in Distributed Computing
Sort
View
CORR
2010
Springer
155views Education» more  CORR 2010»
13 years 7 months ago
A New Upper Bound on the Average Error Exponent for Multiple-Access Channels
A new lower bound for the average probability or error for a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This bound has a structure very similar to...
Ali Nazari, S. Sandeep Pradhan, Achilleas Anastaso...
CVPR
2011
IEEE
13 years 5 months ago
Natural Image Denoising: Optimality and Inherent Bounds
The goal of natural image denoising is to estimate a clean version of a given noisy image, utilizing prior knowledge on the statistics of natural images. The problem has been stud...
Anat Levin, Boaz Nadler
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
13 years 7 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
CONCUR
2010
Springer
13 years 10 months ago
Bisimilarity of One-Counter Processes Is PSPACE-Complete
A one-counter automaton is a pushdown automaton over a singleton stack alphabet. We prove that the bisimilarity of processes generated by nondeterministic one-counter automata (wit...
Stanislav Böhm, Stefan Göller, Petr Janc...
MFCS
2004
Springer
14 years 2 months ago
Online Algorithms for Disk Graphs
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
Ioannis Caragiannis, Aleksei V. Fishkin, Christos ...