Sciweavers

5802 search results - page 1056 / 1161
» Parallelizing Feature Selection
Sort
View
130
Voted
IEEEPACT
2005
IEEE
15 years 8 months ago
HUNTing the Overlap
Hiding communication latency is an important optimization for parallel programs. Programmers or compilers achieve this by using non-blocking communication primitives and overlappi...
Costin Iancu, Parry Husbands, Paul Hargrove
IPPS
2005
IEEE
15 years 8 months ago
An Empirical Study On the Vectorization of Multimedia Applications for Multimedia Extensions
Multimedia extensions (MME) are architectural extensions to general-purpose processors to boost the performance of multimedia workloads. Today, in-line assembly code, intrinsic fu...
Gang Ren, Peng Wu, David A. Padua
PODC
2005
ACM
15 years 8 months ago
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
Fabrizio Grandoni, Jochen Könemann, Alessandr...
GRID
2005
Springer
15 years 8 months ago
Toward seamless grid data access: design and implementation of GridFTP on .NET
— To date, only Linux-/UNIX-based hosts have been participants in the Grid vision for seamless data access, because the necessary Grid data access protocols have not been impleme...
Jun Feng, Lingling Cui, Glenn S. Wasson, Marty Hum...
ICS
2005
Tsinghua U.
15 years 8 months ago
Reducing latencies of pipelined cache accesses through set prediction
With the increasing performance gap between the processor and the memory, the importance of caches is increasing for high performance processors. However, with reducing feature si...
Aneesh Aggarwal
« Prev « First page 1056 / 1161 Last » Next »