Sciweavers

511 search results - page 50 / 103
» Lower bounds for distributed markov chain problems
Sort
View
COLT
2004
Springer
15 years 11 months ago
An Inequality for Nearly Log-Concave Distributions with Applications to Learning
Abstract— We prove that given a nearly log-concave distribution, in any partition of the space to two well separated sets, the measure of the points that do not belong to these s...
Constantine Caramanis, Shie Mannor
ASIACRYPT
2006
Springer
15 years 9 months ago
Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
We consider the problem of cheating in secret sharing schemes, cheating in which individuals submit forged shares in the secret reconstruction phase in an effort to make another pa...
Satoshi Obana, Toshinori Araki
COMPGEOM
2008
ACM
15 years 7 months ago
Self-improving algorithms for delaunay triangulations
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...
Kenneth L. Clarkson, C. Seshadhri
ICFEM
2009
Springer
16 years 10 days ago
Approximate Model Checking of PCTL Involving Unbounded Path Properties
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...
Samik Basu, Arka P. Ghosh, Ru He
CDC
2010
IEEE
107views Control Systems» more  CDC 2010»
15 years 23 days ago
Time-synchronization in mobile sensor networks from difference measurements
We examine distributed time-synchronization in mobile ad-hoc and sensor networks. The problem is to estimate the skews and offsets of clocks of all the nodes with respect to an arb...
Chenda Liao, Prabir Barooah