1060 search results - page 64 / 212 » On the Discovery of Random Trees |
ICIP
2009
IEEE
15 years 9 months ago
2009
IEEE
We propose a binary Markov Random Field (MRF) model
that assigns high probability to regions in the image domain
consisting of an unknown number of circles of a given radius.
We...
SSDBM
1990
IEEE
15 years 2 months ago
1990
IEEE
In this paper we survey known results on algorithms, data structures, and some applications of random sampling from databases. We first discuss various reasons for sampling from d...
COMPGEOM
1993
ACM
15 years 2 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
INFOCOM
2003
IEEE
15 years 3 months ago
2003
IEEE
— We present a novel distributed algorithm for constructing random overlay networks that are composed of d Hamilton cycles. The protocol is completely decentralized as no globall...
PEWASUN
2006
ACM
15 years 4 months ago
2006
ACM
In wireless multi-hop networks, hello protocols for neighbor discovery are a basic service offered by the networking stack. However, their study usually rely on rather simplistic...