201 search results - page 23 / 41 » Computing Hypergeometric Solutions of Linear Recurrence Equa... |
MOC
1998
14 years 9 months ago
1998
Abstract. An iterative procedure for numerical conformal mapping is presented which imposes no restriction on the boundary complexity. The formulation involves two analytically equ...
POPL
2010
ACM
15 years 4 months ago
2010
ACM
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...
CRYPTO
2001
Springer
15 years 2 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
107
click to vote
ISPAN
2002
IEEE
15 years 2 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
Abstract. Computer simulations of realistic applications usually require solving a set of non-linear partial di erential equations PDEs over a nite region. The process of obtaini...