1806 search results - page 117 / 362 » Randomness and halting probabilities |
276
Voted
COMPGEOM
2011
ACM
14 years 7 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
162
click to vote
SIGSOFT
2008
ACM
16 years 4 months ago
2008
ACM
Atomicity is an important specification that enables programmers to understand atomic blocks of code in a multi-threaded program as if they are sequential. This significantly simp...
120
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
153
click to vote
ESORICS
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
157
click to vote
SAC
2010
ACM
15 years 10 months ago
2010
ACM
This paper presents a random finite set theoretic formulation for multi-object tracking as perceived by a 3D-LIDAR in a dynamic environment. It is mainly concerned with the joint...