Sciweavers

171 search results - page 3 / 35
» Maximally fast and arbitrarily fast implementation of linear...
Sort
View
IPPS
2009
IEEE
14 years 2 months ago
Fast development of dense linear algebra codes on graphics processors
—We present an application programming interface (API) for the C programming language that facilitates the development of dense linear algebra algorithms on graphics processors a...
M. Jesús Zafont, Alberto F. Martín, ...
JCB
2008
122views more  JCB 2008»
13 years 7 months ago
Space Efficient Computation of Rare Maximal Exact Matches between Multiple Sequences
In this article, we propose a new method for computing rare maximal exact matches between multiple sequences. A rare match between k sequences S1; : : :; Sk is a string that occur...
Enno Ohlebusch, Stefan Kurtz
JGTOOLS
2006
80views more  JGTOOLS 2006»
13 years 7 months ago
A Fast Method for Local Penetration Depth Computation
In this appendix, we provide some details on the data structures used to cluster the intersection segments. Although the data structures are fairly classical (a heap, a grid and a...
Stephane Redon, Ming C. Lin
TIP
2010
111views more  TIP 2010»
13 years 2 months ago
Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we study a classical demosaicking algorithm based on alternating projections (AP), propos...
Yue M. Lu, Mina Karzand, Martin Vetterli
IOR
2010
114views more  IOR 2010»
13 years 6 months ago
Inventory Management of a Fast-Fashion Retail Network
Working in collaboration with Spain-based retailer Zara, we address the problem of distributing over time a limited amount of inventory across all the stores in a fast-fashion ret...
Felipe Caro, Jérémie Gallien