Sciweavers

557 search results - page 3 / 112
» On the set multi-cover problem in geometric settings
Sort
View
COMPGEOM
2009
ACM
14 years 8 days ago
Near-linear approximation algorithms for geometric hitting sets
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
Pankaj K. Agarwal, Esther Ezra, Micha Sharir
ICDCS
2008
IEEE
14 years 6 days ago
Distributed Connected Dominating Set Construction in Geometric k-Disk Graphs
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
Kai Xing, Wei Cheng, E. K. Park, Shmuel Rotenstrei...
FOCI
2007
IEEE
13 years 9 months ago
Type-2 Fuzzy Sets: Geometric Defuzzification and Type-Reduction
This paper presents the geometric defuzzifier for generalised type-2 fuzzy sets. This defuzzifier can be executed in real-time and can therefore be applied to control and other rea...
Simon Coupland
SIAMAM
2002
122views more  SIAMAM 2002»
13 years 5 months ago
A Level Set Method for Anisotropic Geometric Diffusion in 3D Image Processing
A new morphological multiscale method in 3D image processing is presented which combines the image processing methodology based on nonlinear diffusion equations and the theory of g...
Martin Rumpf, Tobias Preußer
JMIV
2007
116views more  JMIV 2007»
13 years 5 months ago
Viscosity Solutions of a Level-Set Method for Anisotropic Geometric Diffusion in Image Processing
We discuss the existence of viscosity solutions for a class of anisotropic level-set methods which can be seen as an extension of the mean-curvature motion with a nonlinear anisot...
Tobias Preusser