Sciweavers

653 search results - page 86 / 131
» The size of minimum 3-trees
Sort
View
LCTRTS
2010
Springer
15 years 6 months ago
Analysis and approximation for bank selection instruction minimization on partitioned memory architecture
A large number of embedded systems include 8-bit microcontrollers for their energy efficiency and low cost. Multi-bank memory architecture is commonly applied in 8-bit microcontr...
Minming Li, Chun Jason Xue, Tiantian Liu, Yingchao...
INTEGRATION
2007
95views more  INTEGRATION 2007»
14 years 11 months ago
Wire shaping of RLC interconnects
The optimum wire shape to produce the minimum signal propagation delay across an RLC line is shown to exhibit a general exponential form. The line inductance makes exponential tap...
Magdy A. El-Moursy, Eby G. Friedman
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
16 years 14 days ago
Finding, minimizing, and counting weighted subgraphs
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
Virginia Vassilevska, Ryan Williams
STOC
2009
ACM
161views Algorithms» more  STOC 2009»
16 years 14 days ago
List decoding tensor products and interleaved codes
We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. ? We show that for every code, the rat...
Parikshit Gopalan, Venkatesan Guruswami, Prasad Ra...
SIGMOD
2009
ACM
182views Database» more  SIGMOD 2009»
16 years 2 days ago
3-HOP: a high-compression indexing scheme for reachability query
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry