Sciweavers

674 search results - page 10 / 135
» From Constructibility and Absoluteness to Computability and ...
Sort
View
MOC
1998
64views more  MOC 1998»
14 years 9 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...
63
Voted
FOCS
2007
IEEE
15 years 3 months ago
Strongly History-Independent Hashing with Applications
We present a strongly history independent (SHI) hash table that supports search in O(1) worst-case time, and insert and delete in O(1) expected time using O(n) data space. This ma...
Guy E. Blelloch, Daniel Golovin
ENTCS
2006
118views more  ENTCS 2006»
14 years 9 months ago
Domain Theoretic Solutions of Initial Value Problems for Unbounded Vector Fields
This paper extends the domain theoretic method for solving initial value problems, described in [8], to unbounded vector fields. Based on a sequence of approximations of the vecto...
Abbas Edalat, Dirk Pattinson
98
Voted
ICASSP
2011
IEEE
14 years 1 months ago
On the construction of low-pass filters on the unit sphere
This paper considers the problem of construction of low-pass filters on the unit sphere, which has wide ranging applications in the processing of signals on the unit sphere. We p...
Zubair Khalid, Salman Durrani, Rodney A. Kennedy, ...
DCOSS
2008
Springer
14 years 11 months ago
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
Andreas Wiese, Evangelos Kranakis