Sciweavers

6 search results - page 1 / 2
» Reducing Multi-Valued Algebraic Operations to Binary
Sort
View
DATE
2003
IEEE
61views Hardware» more  DATE 2003»
15 years 2 months ago
Reducing Multi-Valued Algebraic Operations to Binary
Jie-Hong Roland Jiang, Alan Mishchenko, Robert K. ...
ISMVL
2007
IEEE
95views Hardware» more  ISMVL 2007»
15 years 3 months ago
Simulation of Gate Circuits with Feedback in Multi-Valued Algebras
Simulation of gate circuits is an efficient method of detecting hazards and oscillations that may occur because of delays. Ternary simulation consists of two algorithms, A and B,...
Janusz A. Brzozowski, Yuli Ye
92
Voted
JSC
2011
99views more  JSC 2011»
14 years 9 days ago
Sparse polynomial division using a heap
In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithm that uses a heap to divide with the same complexit...
Michael B. Monagan, Roman Pearce
CISST
2003
83views Hardware» more  CISST 2003»
14 years 10 months ago
Computational Efficiency of Structural Image Matching
This paper addresses computational efficiency issues of a new algebraic method for imagery registration/conflation. An algebraic approach to conflation/registration of images does ...
Richard Chase, Boris Kovalerchuk
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
14 years 9 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama