1161 search results - page 129 / 233 » Kinetic Dependence Graphs |
97
Voted
ASAP
1997
IEEE
15 years 5 months ago
1997
IEEE
This paper presents how to find optimized buffer size for VLSI architectures of full-search block matching algorithms. Starting from the DG (dependency graph) analysis, we focus i...
82
Voted
VLSID
1994
IEEE
15 years 4 months ago
1994
IEEE
In this paper, we propose an architecture synthesis methodolog `to realize cascaded Infinite Impulse Response (IIRJfilter in Table Look Up (TLU) Field Progmmmable Gate A m y s (FP...
91
Voted
ICALP
1995
Springer
15 years 4 months ago
1995
Springer
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be efï...
102
Voted
FTCS
1998
15 years 2 months ago
1998
The traditional use of formal methods has been for the veri cation of algorithms or protocols. Given the high cost and limitations in state space coverage provided by conventional...
CORR
2010
Springer
15 years 24 days ago
2010
Springer
This paper presents a realization for the reliable and fast startup of distributed systems written in Erlang. The traditional startup provided by the Erlang/OTP library is sequenti...