2638 search results - page 265 / 528 » Random Geometric Complexes |
179
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
215
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper proposes a new approach to describe the salient contours in cluttered scenes. No need to do the preprocessing, such as edge detection, we directly use a set of random s...
153
click to vote
NOMS
2008
IEEE
16 years 1 months ago
2008
IEEE
—In this paper∗ , we devise a novel method for bottleneck analysis of UDP networks based on the concept of network utility maximization. To determine the losses on the links in...
168
click to vote
SASO
2008
IEEE
16 years 1 months ago
2008
IEEE
Many self-organizing and self-adaptive systems use the biologically inspired “gradient” primitive, in which each device in a network estimates its distance to the closest devi...
180
click to vote
GLOBECOM
2007
IEEE
16 years 28 days ago
2007
IEEE
—To understand how node mobility and Byzantine node failures affect connectivity of wireless multi-hop networks, this paper investigates resilience of geometric random graphs to ...