349 search results - page 24 / 70 » Covering a Set of Points with a Minimum Number of Lines |
COMGEO
2011
ACM
13 years 2 months ago
2011
ACM
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
ICDCS
2008
IEEE
14 years 2 months ago
2008
IEEE
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
Given a set of n points in the plane and a collection of k halving lines of P â„“1, . . . , â„“k indexed according to the increasing order of their slopes, we denote by d(â„“j, â„...
SWAT
2010
Springer
14 years 27 days ago
2010
Springer
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
CCS
2008
ACM
13 years 9 months ago
2008
ACM
Low latency anonymity systems are susceptive to traffic analysis attacks. In this paper, we propose a dependent link padding scheme to protect anonymity systems from traffic analy...