Sciweavers

720 search results - page 98 / 144
» Linear k-arboricities on trees
Sort
View
VLSID
2007
IEEE
160views VLSI» more  VLSID 2007»
14 years 10 months ago
Spectral RTL Test Generation for Microprocessors
We introduce a novel method of test generation for microprocessors at the RTL using spectral methods. Test vectors are generated for RTL faults, which are the stuck-at faults on i...
Nitin Yogi, Vishwani D. Agrawal
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 10 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
DCC
2004
IEEE
14 years 9 months ago
Reduced Complexity Wavelet-Based Predictive Coding of Hyperspectral Images for FPGA Implementation
We present an algorithm for lossy compression of hyperspectral images for implementation on field programmable gate arrays (FPGA). To greatly reduce the bit rate required to code ...
Agnieszka C. Miguel, Amanda R. Askew, Alexander Ch...
ICCAD
2005
IEEE
95views Hardware» more  ICCAD 2005»
14 years 6 months ago
TACO: temperature aware clock-tree optimization
— In this paper, an efficient linear time algorithm TACO is proposed for the first time to minimize the worst case clock skew in the presence of on-chip thermal variation. TACO...
Minsik Cho, Suhail Ahmed, David Z. Pan
FCCM
2008
IEEE
153views VLSI» more  FCCM 2008»
14 years 4 months ago
A SRAM-based Architecture for Trie-based IP Lookup Using FPGA
Internet Protocol (IP) lookup in routers can be implemented by some form of tree traversal. Pipelining can dramatically improve the search throughput. However, it results in unbal...
Hoang Le, Weirong Jiang, Viktor K. Prasanna