Sciweavers

719 search results - page 101 / 144
» Sizing router buffers
Sort
View
98
Voted
ACSC
2004
IEEE
15 years 4 months ago
In-Place versus Re-Build versus Re-Merge: Index Maintenance Strategies for Text Retrieval Systems
Indexes are the key technology underpinning efficient text search. A range of algorithms have been developed for fast query evaluation and for index creation, but update algorithm...
Nicholas Lester, Justin Zobel, Hugh E. Williams
DATE
2004
IEEE
146views Hardware» more  DATE 2004»
15 years 4 months ago
Data Reuse Analysis Technique for Software-Controlled Memory Hierarchies
In multimedia and other streaming applications a significant portion of energy is spent on data transfers. Exploiting data reuse opportunities in the application, we can reduce th...
Ilya Issenin, Erik Brockmeyer, Miguel Miranda, Nik...
ASPDAC
2008
ACM
129views Hardware» more  ASPDAC 2008»
15 years 2 months ago
Clock tree synthesis with data-path sensitivity matching
This paper investigates methods for minimizing the impact of process variation on clock skew using buffer and wire sizing. While most papers on clock trees ignore data-path circuit...
Matthew R. Guthaus, Dennis Sylvester, Richard B. B...
103
Voted
ASPDAC
2005
ACM
98views Hardware» more  ASPDAC 2005»
15 years 2 months ago
Process variation robust clock tree routing
As the minimum feature sizes of VLSI circuits get smaller while the clock frequency increases, the effects of process variations become significant. We propose a UST/DME based ap...
Wai-Ching Douglas Lam, Cheng-Kok Koh
89
Voted
GRAPHICSINTERFACE
2003
15 years 1 months ago
A Stream Algorithm for the Decimation of Massive Meshes
We present an out-of-core mesh decimation algorithm that is able to handle input and output meshes of arbitrary size. The algorithm reads the input from a data stream in a single ...
Jianhua Wu, Leif Kobbelt