Sciweavers

1806 search results - page 88 / 362
» Randomness and halting probabilities
Sort
View
133
Voted
ENTCS
2006
117views more  ENTCS 2006»
15 years 3 months ago
Probabilistic and Nondeterministic Aspects of Anonymity
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
Catuscia Palamidessi
90
Voted
DCG
2007
79views more  DCG 2007»
15 years 3 months ago
Typical Cells in Poisson Hyperplane Tessellations
It is proved that the shape of the typical cell of a stationary and isotropic Poisson random hyperplane tessellation is, with high probability, close to the shape of a ball if the ...
Daniel Hug, Rolf Schneider
SODA
2010
ACM
186views Algorithms» more  SODA 2010»
15 years 1 months ago
An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
We consider the Asymmetric Traveling Salesman problem for costs satisfying the triangle inequality. We derive a randomized algorithm which delivers a solution within a factor O(lo...
Arash Asadpour, Michel X. Goemans, Aleksander Madr...
155
Voted
TIT
2011
121views more  TIT 2011»
14 years 10 months ago
Strongly Consistent Estimation of the Sample Distribution of Noisy Continuous-Parameter Fields
The general problem of defining and determining the sample distribution in the case of continuousparameter random fields, is addressed. Defining a distribution in the case of d...
Shahar Z. Kovalsky, Guy Cohen, Joseph M. Francos
ICALP
2007
Springer
15 years 7 months ago
Online Conflict-Free Colorings for Hypergraphs
We provide a framework for online conflict-free coloring (CF-coloring) of any hypergraph. We use this framework to obtain an efficient randomized online algorithm for CF-coloring ...
Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olon...