144 search results - page 24 / 29 » Unit disk graph approximation |
RTCSA
2000
IEEE
15 years 2 months ago
2000
IEEE
As a starting point for static program analysis a control flow graph (CFG) is needed. If only the binary executable is available, this CFG has to be reconstructed from sequences ...
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
PODC
2009
ACM
15 years 10 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
104
click to vote
DIALM
2004
ACM
15 years 3 months ago
2004
ACM
Coping with mobility and dynamism is one of the biggest challenges in ad hoc networks. An essential requirement for such networks is a service that can establish communication ses...
TMC
2011
14 years 4 months ago
2011
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...