Sciweavers

1243 search results - page 47 / 249
» On the locality of bounded growth
Sort
View
APPROX
2011
Springer
272views Algorithms» more  APPROX 2011»
12 years 7 months ago
Public Key Locally Decodable Codes with Short Keys
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
Brett Hemenway, Rafail Ostrovsky, Martin J. Straus...
CVBIA
2005
Springer
14 years 1 months ago
Registration of PET and MR Hand Volumes Using Bayesian Networks
Abstract. A method for the non-rigid, multi-modal, registration of volumetric scans of human hands is presented. PET and MR scans are aligned by optimising the configuration of a ...
Derek R. Magee, Steven Tanner, Michael Waller, Den...
INFOCOM
2011
IEEE
12 years 11 months ago
Sensor localization with deterministic accuracy guarantee
—Localizability of network or node is an important subproblem in sensor localization. While rigidity theory plays an important role in identifying several localizability conditio...
Ryo Sugihara, Rajesh K. Gupta
LICS
2007
IEEE
14 years 1 months ago
Locally Excluding a Minor
We introduce the concept of locally excluded minors. Graph classes locally excluding a minor are a common generalisation of the concept of excluded minor classes and of graph clas...
Anuj Dawar, Martin Grohe, Stephan Kreutzer
DCOSS
2009
Springer
14 years 9 days ago
Local Construction of Spanners in the 3-D Space
Abstract. In this paper we present local distributed algorithms for constructing spanners in wireless sensor networks modeled as unit ball graphs (shortly UBGs) and quasi-unit ball...
Iyad A. Kanj, Ge Xia, Fenghui Zhang