Sciweavers

1243 search results - page 19 / 249
» On the locality of bounded growth
Sort
View
MOC
1998
64views more  MOC 1998»
13 years 7 months ago
Analysis of non-overlapping domain decomposition algorithms with inexact solves
In this paper we construct and analyze new non-overlapping domain decomposition preconditioners for the solution of second-order elliptic and parabolic boundary value problems. The...
James H. Bramble, Joseph E. Pasciak, Apostol T. Va...
ECCC
2010
147views more  ECCC 2010»
13 years 2 months ago
A Note on Amplifying the Error-Tolerance of Locally Decodable Codes
Trevisan [Tre03] suggested a transformation that allows amplifying the error rate a code can handle. We observe that this transformation, that was suggested in the non-local setti...
Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma
WETICE
2003
IEEE
14 years 26 days ago
Coordination in Pervasive Computing Environments
Computer science and engineering nowadays appears to be challenged (and driven) by technological progress and quantitative growth. Among the technological progress challenges are ...
Alois Ferscha
COCO
1992
Springer
82views Algorithms» more  COCO 1992»
13 years 11 months ago
Functional Characterizations of Uniform Log-depth and Polylog-depth Circuit Families
We characterize the classes of functions computable by uniform log-depth (NC1) and polylog-depth circuit families as closures of a set of base functions. (The former is equivalent...
Stephen A. Bloch
COLOGNETWENTE
2007
13 years 9 months ago
Approximating minimum independent dominating sets in wireless networks
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
Johann Hurink, Tim Nieberg