Sciweavers

455 search results - page 75 / 91
» Improved Force-Directed Layouts
Sort
View
SIGGRAPH
2010
ACM
13 years 12 months ago
Feature-aligned T-meshes
High-order and regularly sampled surface representations are more efficient and compact than general meshes and considerably simplify many geometric modeling and processing algor...
Ashish Myles, Nico Pietroni, Denis Kovacs, Denis Z...
VLDB
2001
ACM
121views Database» more  VLDB 2001»
13 years 11 months ago
Weaving Relations for Cache Performance
Relational database systems have traditionally optimzed for I/O performance and organized records sequentially on disk pages using the N-ary Storage Model (NSM) (a.k.a., slotted p...
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill...
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
13 years 11 months ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
CODES
2000
IEEE
13 years 11 months ago
Co-design of interleaved memory systems
Memory interleaving is a cost-efficient approach to increase bandwidth. Improving data access locality and reducing memory access conflicts are two important aspects to achieve hi...
Hua Lin, Wayne Wolf
ICCAD
2000
IEEE
97views Hardware» more  ICCAD 2000»
13 years 11 months ago
Error Catch and Analysis for Semiconductor Memories Using March Tests
We present an error catch and analysis (ECA) system for semiconductor memories. The system consists of a test algorithm generator called TAGS, a fault simulator called RAMSES, and...
Chi-Feng Wu, Chih-Tsun Huang, Chih-Wea Wang, Kuo-L...