Sciweavers

4581 search results - page 495 / 917
» Computing Transformation Semigroups
Sort
View
IPPS
1998
IEEE
15 years 11 months ago
Sharing Random Bits with No Process Coordination
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...
Marius Zimand
IPPS
1998
IEEE
15 years 11 months ago
On Randomized and Deterministic Schemes for Routing and Sorting on Fixed-Connection Networks
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...
Torsten Suel
DAC
1997
ACM
15 years 11 months ago
A Parallel/Serial Trade-Off Methodology for Look-Up Table Based Decoders
A methodology for architecture exploration of look-up table based decoders is presented. For the degree of parallel processing a trade-off can be made by exploring system level an...
Claus Schneider
CGI
1996
IEEE
15 years 11 months ago
Recent Advances in Image Morphing
Image morphing has been the subject of much attention in recent years. It has proven to be a powerful visual effects tool in film and television, depicting the fluid transformatio...
George Wolberg
DAC
1996
ACM
15 years 11 months ago
Pseudorandom-Pattern Test Resistance in High-Performance DSP Datapaths
The testability of basic DSP datapath structures using pseudorandom built-in self-test techniques is examined. The addition of variance mismatched signals is identified as a testi...
Laurence Goodby, Alex Orailoglu