Sciweavers

PLDI
1995
ACM
14 years 1 months ago
Tile Size Selection Using Cache Organization and Data Layout
When dense matrix computations are too large to fit in cache, previous research proposes tiling to reduce or eliminate capacity misses. This paper presents a new algorithm for ch...
Stephanie Coleman, Kathryn S. McKinley
LCPC
1995
Springer
14 years 1 months ago
Demand-Driven, Symbolic Range Propagation
Abstract. To e ectively parallelize real programs, parallelizing compilers need powerful symbolic analysis techniques 13, 6]. In previous work we have introduced an algorithm calle...
William Blume, Rudolf Eigenmann
ISSAC
1995
Springer
125views Mathematics» more  ISSAC 1995»
14 years 1 months ago
Numeric-Symbolic Algorithms for Evaluating One-Dimensional Algebraic Sets
: We present e cient algorithms based on a combination of numeric and symbolic techniques for evaluating one-dimensional algebraic sets in a subset of the real domain. Given a desc...
Shankar Krishnan, Dinesh Manocha
ISSAC
1995
Springer
119views Mathematics» more  ISSAC 1995»
14 years 1 months ago
The Singular Value Decomposition for Polynomial Systems
This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients are inexact or imperfectly known....
Robert M. Corless, Patrizia M. Gianni, Barry M. Tr...
ISCAS
1995
IEEE
72views Hardware» more  ISCAS 1995»
14 years 1 months ago
Implementation and Test Results of a Chip for the Separation of Mixed Signals
We describe an algorithm and chip implementation for separating a mixture of unknown, but independent, temporal signals in static and dynamic environments. The proposed algorithm,...
Ammar B. A. Gharbi, Fathi M. A. Salam
ISAAC
1995
Springer
97views Algorithms» more  ISAAC 1995»
14 years 1 months ago
A Linear Time Algorithm For Finding Maximal Planar Subgraphs
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
Wen-Lian Hsu
IPPS
1995
IEEE
14 years 1 months ago
Symbolic range propagation
Abstract. To e ectively parallelize real programs, parallelizing compilers need powerful symbolic analysis techniques 13, 6 . In previous work we have introduced an algorithm calle...
William Blume, Rudolf Eigenmann
INFOCOM
1995
IEEE
14 years 1 months ago
A Fast Bypass Algorithm for High-Speed Networks
In this work we suggest an algorithm that increases the reservation success probability for bursty tra c in high speed networks by adding exibility to the construction of the rout...
Israel Cidon, Raphael Rom, Yuval Shavitt
IMA
1995
Springer
97views Cryptology» more  IMA 1995»
14 years 1 months ago
A New Algorithm for Finding Minimum-Weight Words in Large Linear Codes
An algorithm for finding small-weight words in large linear codes is developed and a precise analysis of its complexity is given. It is in particular able to decode random [512,256...
Anne Canteaut
ICDCS
1995
IEEE
14 years 1 months ago
Implementing Sequentially Consistent Shared Objects Using Broadcast and Point-to-Point Communication
A distributed algorithm that implements a sequentially consistent collection of shared read/update objects using a combination of broadcast and point-to-point communication is pre...
Alan Fekete, M. Frans Kaashoek, Nancy A. Lynch