6480 search results - page 85 / 1296 » Proximity Communication and Time |
129
Voted
CCCG
2006
15 years 5 months ago
2006
For a given point set in Euclidean space we consider the problem of finding (approximate) nearest neighbors of a query point but restricting only to points that lie within a fixed...
172
Voted
CCCG
2006
15 years 5 months ago
2006
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
243
click to vote
CDC
2009
IEEE
15 years 1 months ago
2009
IEEE
Abstract-- We consider a wireless system with a small number of delay constrained users and a larger number of users without delay constraints. We develop a scheduling algorithm th...
ICWSM
2009
15 years 1 months ago
2009
In spite of enormous previous efforts to model the growth of various networks, there have only been a few works that successfully describe the evolution of latent networks. In a l...
146
click to vote
CJ
1999
15 years 3 months ago
1999
We present a compiler optimization approach that uses the simulated evolution (SE) paradigm to enhance the finish time of heuristically scheduled computations with communication t...