Sciweavers

9264 search results - page 1458 / 1853
» Space Between Languages
Sort
View
LCPC
1997
Springer
15 years 11 months ago
Automatic Data Decomposition for Message-Passing Machines
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...
Mirela Damian-Iordache, Sriram V. Pemmaraju
SIGMOD
1996
ACM
120views Database» more  SIGMOD 1996»
15 years 11 months ago
Implementing Data Cubes Efficiently
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data ...
Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ull...
STOC
1996
ACM
100views Algorithms» more  STOC 1996»
15 years 11 months ago
The Linear-Array Conjecture in Communication Complexity is False
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky
IPPS
1994
IEEE
15 years 11 months ago
Shared Virtual Memory and Generalized Speedup
Generalized speedup is de ned as parallel speed over sequential speed. In this paper the generalized speedup and its relation with other existing performance metrics, such as trad...
Xian-He Sun, Jianping Zhu
COMPGEOM
1994
ACM
15 years 11 months ago
Query-Sensitive Ray Shooting
Ray (segment) shooting is the problem of determining the first intersection between a ray (directed line segment) and a collection of polygonal or polyhedral obstacles. In order t...
Joseph S. B. Mitchell, David M. Mount, Subhash Sur...
« Prev « First page 1458 / 1853 Last » Next »