599 search results - page 70 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
PVLDB
2010
14 years 8 months ago
2010
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...
JMLR
2008
14 years 9 months ago
2008
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
137
click to vote
COMPGEOM
2011
ACM
14 years 1 months ago
2011
ACM
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...
ICIAP
2003
ACM
15 years 9 months ago
2003
ACM
A novel approach is presented to select multiple key frames within an isolated video shot where there is camera motion causing significant scene change. This is achieved by determ...
100
click to vote
ICST
2010
IEEE
14 years 8 months ago
2010
IEEE
—Recent advances in automated functional testing of Graphical User Interfaces (GUIs) rely on deriving graph models that approximate all possible sequences of events that may be e...