Sciweavers

111 search results - page 12 / 23
» Response Time Properties of Some Asynchronous Circuits
Sort
View
ASPDAC
2007
ACM
80views Hardware» more  ASPDAC 2007»
13 years 11 months ago
Recognition of Fanout-free Functions
Factoring is a logic minimization technique to represent a Boolean function in an equivalent function with minimum literals. When realizing the circuit, a function represented in ...
Tsung-Lin Lee, Chun-Yao Wang
ICASSP
2011
IEEE
12 years 11 months ago
Explicit recursivity into reproducing kernel Hilbert spaces
This paper presents a methodology to develop recursive filters in reproducing kernel Hilbert spaces (RKHS). Unlike previous approaches that exploit the kernel trick on filtered ...
Devis Tuia, Gustavo Camps-Valls, Manel Martí...
PARLE
1987
13 years 11 months ago
Emulating Digital Logic using Transputer Networks (very High Parallelism = Simplicity = Performance)
Modern VLSI technology has changed the economic rules by which the balance between processing power, memory and communications is decided in computing systems. This will have a pr...
Peter H. Welch
SIROCCO
2010
13 years 9 months ago
Algorithms for Extracting Timeliness Graphs
We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p, q) is an e...
Carole Delporte-Gallet, Stéphane Devismes, ...
CORR
2011
Springer
148views Education» more  CORR 2011»
13 years 2 months ago
On Stabilization in Herman's Algorithm
Herman’s algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ring consisting of N processes. The interaction of tokens makes the dynamics o...
Stefan Kiefer, Andrzej S. Murawski, Joël Ouak...