963 search results - page 64 / 193 » On Computation of Performance Bounds of Optimal Index Assign... |
171
click to vote
IPPS
2005
IEEE
15 years 11 months ago
2005
IEEE
Sparse and irregular computations constitute a large fraction of applications in the data-intensive scientific domain. While every effort is made to balance the computational wor...
167
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
In this paper we propose a practical and efficient method for finding the globally optimal solution to the problem of pose estimation of a known object. We present a framework tha...
176
click to vote
ICDT
2003
ACM
15 years 11 months ago
2003
ACM
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
173
click to vote
HIPC
2009
Springer
15 years 3 months ago
2009
Springer
In many-core architectures, memory blocks are commonly assigned to the banks of a NUCA cache by following a physical mapping. This mapping assigns blocks to cache banks in a round-...
170
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
In this paper, we present nearly optimal algorithms for broadcast on a d-dimensional nn:::n torus that supports all-port communication and wormhole routing. Let Tn denote the numb...