Sciweavers

349 search results - page 11 / 70
» Covering a Set of Points with a Minimum Number of Lines
Sort
View
WADS
2007
Springer
98views Algorithms» more  WADS 2007»
14 years 1 months ago
Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field
We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line seg...
Senjuti Basu Roy, Gautam Das, Sajal Das
IMC
2003
ACM
14 years 1 months ago
On the number of distributed measurement points for network tomography
Internet topology information is only made available in aggregate form by standard routing protocols. Connectivity information and latency characteristicsmust therefore be inferre...
Joseph Douglas Horton, Alejandro López-Orti...
JCAM
2010
82views more  JCAM 2010»
13 years 2 months ago
Menke points on the real line and their connection to classical orthogonal polynomials
Abstract. We investigate the properties of extremal point systems on the real line consisting of two interlaced sets of points solving a modified minimum energy problem. We show th...
P. Mathur, J. S. Brauchart, Edward B. Saff
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 7 months ago
Restricted Strip Covering and the Sensor Cover Problem
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh...
COMGEO
2011
ACM
13 years 2 months ago
Covering points by disjoint boxes with outliers
For a set of n points in the plane, we consider the axis–aligned (p, k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain at least n − k...
Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin...