Sciweavers

137 search results - page 20 / 28
» Maintaining the Approximate Width of a Set of Points in the ...
Sort
View
WINET
2008
86views more  WINET 2008»
13 years 7 months ago
Relay sensor placement in wireless sensor networks
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum nu...
Xiuzhen Cheng, Ding-Zhu Du, Lusheng Wang, Baogang ...
SODA
2010
ACM
162views Algorithms» more  SODA 2010»
14 years 4 months ago
The forest hiding problem
Let be a disk of radius R in the plane. A set F of closed unit disks contained in forms a maximal packing if the unit disks are pairwise disjoint and the set is maximal: i.e., i...
Adrian Dumitrescu, Minghui Jiang
PG
2007
IEEE
14 years 1 months ago
Image-Space Caustics and Curvatures
Caustics are important visual phenomena, as well as challenging global illumination effects in computer graphics. Physically caustics can be interpreted from one of two perspectiv...
Xuan Yu, Feng Li, Jingyi Yu
INFORMS
1998
100views more  INFORMS 1998»
13 years 7 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
COMPGEOM
2006
ACM
14 years 1 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...