Sciweavers

2374 search results - page 103 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
ICCV
2003
IEEE
15 years 3 months ago
Computing MAP trajectories by representing, propagating and combining PDFs over groups
This paper addresses the problem of computing the trajectory of a camera from sparse positional measurements that have been obtained from visual localisation, and dense differenti...
Paul Smith, Tom Drummond, Kimon Roussopoulos
SPAA
1999
ACM
15 years 2 months ago
Recursive Array Layouts and Fast Parallel Matrix Multiplication
Matrix multiplication is an important kernel in linear algebra algorithms, and the performance of both serial and parallel implementations is highly dependent on the memory system...
Siddhartha Chatterjee, Alvin R. Lebeck, Praveen K....
STOC
1999
ACM
104views Algorithms» more  STOC 1999»
15 years 2 months ago
Fast Approximate PCPs
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
HIPC
2009
Springer
14 years 7 months ago
Automatic data placement and replication in grids
Data grids provide geographically distributed storage and computing resources for large data-intensive applications. To support fast data access and processing, effective data man...
Ying Ding, Ying Lu
HCW
2000
IEEE
15 years 2 months ago
Fast and Effective Task Scheduling in Heterogeneous Systems
Recently, we presented two very low-cost approaches to compile-time list scheduling where the tasks’ priorities are computed statically or dynamically, respectively. For homogen...
Andrei Radulescu, Arjan J. C. van Gemund