Sciweavers

19320 search results - page 3677 / 3864
» On the complexity of computing determinants
Sort
View
PPOPP
1997
ACM
15 years 9 months ago
Performance Implications of Communication Mechanisms in All-Software Global Address Space Systems
Global addressing of shared data simplifies parallel programming and complements message passing models commonly found in distributed memory machines. A number of programming sys...
Beng-Hong Lim, Chi-Chao Chang, Grzegorz Czajkowski...
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 9 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
DAC
1994
ACM
15 years 9 months ago
A Communicating Petri Net Model for the Design of Concurrent Asynchronous Modules
Current asynchronous tools are focussed mainly on the design of a single interface module. In many applications, one must design interacting interface modules that potentially comm...
Gjalt G. de Jong, Bill Lin
OOIS
1994
Springer
15 years 9 months ago
Problems, Descriptions and Objects
The business of software development is solving problems. Following Polya, we can increase our ability to solve problems by focusing directly on problems themselves, on their part...
Michael Jackson
161
Voted
SIGMOD
1994
ACM
106views Database» more  SIGMOD 1994»
15 years 9 months ago
Multi-Step Processing of Spatial Joins
Spatial joins are one of the most important operations for combining spatial objects of several relations. In this paper, spatial join processing is studied in detail for extended...
Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneid...
« Prev « First page 3677 / 3864 Last » Next »