174 search results - page 22 / 35 » Connected dominating sets on dynamic geometric graphs |
209
click to vote
SSD
1993
Springer
15 years 10 months ago
1993
Springer
: Spatial data types or algebras for database systems should (i) be fully general (which means, closed under set operations, hence e.g. a region value can be a set of polygons with...
152
click to vote
PAMI
2007
15 years 5 months ago
2007
—Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different soluti...
168
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We present an efficient algorithm for maintaining the boundary and surface area of protein molecules as they undergo conformational changes. We also describe a robust implementati...
187
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
156
click to vote
AUTOMATICA
2010
15 years 6 months ago
2010
We propose a class of discrete-time dynamic average consensus algorithms that allow a group of agents to track the average of their reference inputs. The convergence results rely ...