Sciweavers

4940 search results - page 565 / 988
» On the Complexity of Universal Programs
Sort
View
PVM
2000
Springer
15 years 10 months ago
Runtime Checking of Datatype Signatures in MPI
Abstract. The MPI standard provides a way to send and receive complex combinations of datatypes (e.g., integers and doubles) with a single communication operation. The MPI standard...
William Gropp
CORR
2008
Springer
82views Education» more  CORR 2008»
15 years 6 months ago
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
Gilles Villard
CN
2006
75views more  CN 2006»
15 years 6 months ago
Dynamic online QoS routing schemes: Performance and bounds
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
Antonio Capone, Luigi Fratta, Fabio Martignon
CORR
2006
Springer
127views Education» more  CORR 2006»
15 years 6 months ago
Guessing Facets: Polytope Structure and Improved LP Decoder
Abstract--We investigate the structure of the polytope underlying the linear programming (LP) decoder introduced by Feldman, Karger, and Wainwright. We first show that for expander...
Alexandros G. Dimakis, Martin J. Wainwright
180
Voted
CACM
2007
164views more  CACM 2007»
15 years 6 months ago
Is abstraction the key to computing?
ACTION THE KEY TO COMPUTING? Why is it that some software engineers and computer scientists are able to produce clear, elegant designs and programs, while others cannot? Is it poss...
Jeff Kramer