1763 search results - page 32 / 353 » Dependent random choice |
STOC
2002
ACM
14 years 9 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
EMNLP
2006
13 years 10 months ago
2006
We describe a probabilistic approach to content selection for meeting summarization. We use skipchain Conditional Random Fields (CRF) to model non-local pragmatic dependencies bet...
NDSS
2009
IEEE
14 years 3 months ago
2009
IEEE
We describe CSAR, a novel technique for generating cryptographically strong, accountable randomness. Using CSAR, we can generate a pseudo-random sequence and a proof that the elem...
EC
2007
13 years 9 months ago
2007
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
CDC
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract— This paper is concerned with the robust stabilization of a class of stochastic large-scale systems. The uncertainties satisfy integral quadratic constraints. The random...