2638 search results - page 235 / 528 » Random Geometric Complexes |
175
Voted
ADHOCNOW
2006
Springer
16 years 18 days ago
2006
Springer
We consider an ad-hoc network consisting of devices that try to gain access for transmission through a shared communication channel. We redesign randomized protocol of Cai, Lu and ...
167
click to vote
ISMVL
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper considers quasi-reduced multi-valued decision diagrams with bits (QRMDD( )s) to represent twovalued logic functions. It shows relations between the numbers of nodes in ...
159
click to vote
FOCS
1990
IEEE
15 years 10 months ago
1990
IEEE
In [Sh92], Adi Shamir proved a complete characterization of the complexity class IP. He showed that when both randomization and interaction are allowed, the proofs that can be ver...
194
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
180
click to vote
AC
2003
Springer
15 years 12 months ago
2003
Springer
Abstract—The dynamics of the survival of recruiting fish are analyzed as evolving random processes of aggregation and mortality. The analyses draw on recent advances in the phys...