6105 search results - page 1112 / 1221 » A Parallel Algorithm for Bound-Smoothing |
120
click to vote
HPCA
2002
IEEE
16 years 1 months ago
2002
IEEE
The increasing performance gap between processors and memory will force future architectures to devote significant resources towards removing and hiding memory latency. The two ma...
186
click to vote
SIGMOD
2007
ACM
16 years 1 months ago
2007
ACM
We present GPUQP, a relational query engine that employs both CPUs and GPUs (Graphics Processing Units) for in-memory query co-processing. GPUs are commodity processors traditiona...
118
click to vote
SIGMOD
2003
ACM
16 years 1 months ago
2003
ACM
We propose a framework for integrating data from multiple relational sources into an XML document that both conforms to a given DTD and satisfies predefined XML constraints. The f...
121
click to vote
ICDCS
2009
IEEE
15 years 10 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
122
click to vote
ICDCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract: Current peer-to-peer systems are network-agnostic, often generating large volumes of unnecessary inter-ISP traffic. Although recent work has shown the benefits of ISP-a...