Sciweavers

2434 search results - page 146 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
INFOCOM
2011
IEEE
14 years 7 months ago
Sharing multiple messages over mobile networks
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...
Yuxin Chen, Sanjay Shakkottai, Jeffrey G. Andrews
FSTTCS
2004
Springer
15 years 9 months ago
Testing Geometric Convexity
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
Luis Rademacher, Santosh Vempala
AAAI
1997
15 years 5 months ago
Effective Bayesian Inference for Stochastic Programs
In this paper, we propose a stochastic version of a general purpose functional programming language as a method of modeling stochastic processes. The language contains random choi...
Daphne Koller, David A. McAllester, Avi Pfeffer
AUTOMATICA
2002
93views more  AUTOMATICA 2002»
15 years 3 months ago
A probabilistic framework for problems with real structured uncertainty in systems and control
The objective of this paper is twofold. First, the problem of generation of real random matrix samples with uniform distribution in structured (spectral) norm bounded sets is stud...
Giuseppe Carlo Calafiore, Fabrizio Dabbene
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
15 years 5 months ago
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
Richard Matthew McCutchen, Samir Khuller