Sciweavers

7168 search results - page 804 / 1434
» A Factorization Approach to Grouping
Sort
View
STOC
1998
ACM
111views Algorithms» more  STOC 1998»
15 years 11 months ago
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
Nathan Linial, Alex Samorodnitsky, Avi Wigderson
DATE
1997
IEEE
75views Hardware» more  DATE 1997»
15 years 11 months ago
Using constraint logic programming in memory synthesis for general purpose computers
In modern computer systems the performance is dominated by the memory performance. Currently, there is neither a systematic design methodology nor a tool for the design of memory ...
Renate Beckmann, Jürgen Herrmann
IPPS
1997
IEEE
15 years 11 months ago
A Parallel Priority Data Structure with Applications
We present a parallel priority data structure that improves the running time of certain algorithms for problems that lack a fast and work-efficient parallel solution. As a main a...
Gerth Stølting Brodal, Jesper Larsson Tr&au...
IPPS
1996
IEEE
15 years 11 months ago
Efficient Run-Time Support for Irregular Task Computations with Mixed Granularities
Many irregular scientific computing problems can be modeled by directed acyclic task graphs (DAGs). In this paper, we present an efficient run-time system for executing general as...
Cong Fu, Tao Yang
HPCN
1997
Springer
15 years 11 months ago
Performance Evaluation of HPCN Applications
The performance attained by parallel programs executed on multiprocessor systems is largely in uenced both by the characteristics of the code and by those of the system architectu...
Alessandro P. Merlo