Sciweavers

327 search results - page 57 / 66
» Some Elimination Problems for Matrices
Sort
View
PEPM
1994
ACM
14 years 3 months ago
Improving CPS-Based Partial Evaluation: Writing Cogen by Hand
It is well-known that self-applicable partial evaluation can be used to generate compiler generators: cogen = mix(mix;mix), where mix is the specializer (partial evaluator). Howev...
Anders Bondorf, Dirk Dussart
ICONIP
2007
14 years 10 days ago
Using Generalization Error Bounds to Train the Set Covering Machine
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
Zakria Hussain, John Shawe-Taylor
AC
2000
Springer
13 years 10 months ago
State of the art in electronic payment systems
nvented abstract representations of value. As time passed, representations of value became more abstract, progressing from barter through bank notes, payment orders, checks, credit...
N. Asokan, Philippe A. Janson, Michael Steiner, Mi...
CONCURRENCY
1998
139views more  CONCURRENCY 1998»
13 years 10 months ago
Applications experience in Jade
This paper presents our experience developing applications in Jade, a portable, implicitly parallel programming language designed for exploiting task-level concurrency. Jade progr...
Martin C. Rinard
TPDS
2010
93views more  TPDS 2010»
13 years 9 months ago
Self-Consistent MPI Performance Guidelines
Message passing using the Message Passing Interface (MPI) is at present the most widely adopted framework for programming parallel applications for distributed-memory and clustere...
Jesper Larsson Träff, William D. Gropp, Rajee...