2703 search results - page 362 / 541 » Optimizing memory transactions |
123
Voted
NIPS
2004
15 years 5 months ago
2004
We describe an algorithm for support vector machines (SVM) that can be parallelized efficiently and scales to very large problems with hundreds of thousands of training vectors. I...
110
Voted
COR
2008
15 years 3 months ago
2008
Discrete-time optimal control problems arise naturally in many economic problems. Despite the rapid growth in computing power and new developments in the literature, many economic...
122
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
An erasure channel with a fixed alphabet size q, where q 1, is studied . It is proved that over any erasure channel (with or without memory), Maximum Distance Separable (MDS) codes...
117
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
The problem of discrete universal filtering, in which the components of a discrete signal emitted by an unknown source and corrupted by a known discrete memoryless channel (DMC) ar...
127
Voted
LISP
2008
15 years 3 months ago
2008
For functional programs, unboxing aggregate data structures such as tuples removes memory indirections and frees dead components of the decoupled structures. To explore the consequ...