174 search results - page 14 / 35 » Connected dominating sets on dynamic geometric graphs |
193
click to vote
CVPR
2003
IEEE
15 years 11 months ago
2003
IEEE
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
144
click to vote
AOSD
2006
ACM
16 years 7 hour ago
2006
ACM
OOP style requires programmers to organize their code according to objects (or nouns, using natural language as a metaphor), causing a program’s actions (verbs) to become scatte...
188
click to vote
COMGEO
1999
ACM
15 years 5 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
152
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
— In this paper, we study the dynamics of a viral spreading process in random geometric graphs (RGG). The spreading of the viral process we consider in this paper is closely rela...
131
click to vote
ESA
2009
Springer
16 years 18 days ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...