555 search results - page 100 / 111 » Linear decomposition algorithm for VLSI design applications |
APCSAC
2005
IEEE
15 years 3 months ago
2005
IEEE
Fibonacci Cubes (FCs), together with the enhanced and extended forms, are a family of interconnection topologies formed by diluting links from binary hypercube. While they scale up...
ICDCS
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...
101
click to vote
DEBS
2009
ACM
15 years 1 months ago
2009
ACM
One of the main challenges faced by content-based publish/subscribe systems is handling large amount of dynamic subscriptions and publications in a multidimensional content space....
CSR
2008
Springer
14 years 11 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
106
click to vote
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
The communication protocol IEEE 802.15.4 is becoming pervasive for low power and low data rate wireless sensor networks (WSNs) applications, including control and automation. Never...