142 search results - page 24 / 29 » Augmenting the connectivity of geometric graphs |
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
TMC
2011
13 years 2 months ago
2011
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
SMI
2006
IEEE
14 years 1 months ago
2006
IEEE
Sparse Low-degree IMplicit (SLIM) surface [11] is a recently developed non-conforming surface representation. In this paper, a method for free-form deformation of SLIM surfaces is...
ESA
2003
Springer
14 years 20 days ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
KDD
1997
ACM
13 years 11 months ago
1997
ACM
In this paper 1 we present a method for discovering approximately common motifs (also known as active motifs) in three dimensional (3D) molecules. Each node in a molecule is repre...