Sciweavers

2652 search results - page 424 / 531
» Privacy-preserving linear programming
Sort
View
VLSID
1999
IEEE
88views VLSI» more  VLSID 1999»
15 years 2 months ago
New and Exact Filling Algorithms for Layout Density Control
To reduce manufacturing variation due to chemicalmechanical polishing and to improve yield, layout must be made uniform with respect to density criteria. This is achieved by layou...
Andrew B. Kahng, Gabriel Robins, Anish Singh, Alex...
ICS
1999
Tsinghua U.
15 years 2 months ago
Nonlinear array layouts for hierarchical memory systems
Programming languages that provide multidimensional arrays and a flat linear model of memory must implement a mapping between these two domains to order array elements in memory....
Siddhartha Chatterjee, Vibhor V. Jain, Alvin R. Le...
IEEEPACT
1998
IEEE
15 years 2 months ago
A Matrix-Based Approach to the Global Locality Optimization Problem
Global locality analysis is a technique for improving the cache performance of a sequence of loop nests through a combination of loop and data layout optimizations. Pure loop tran...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
RECOMB
1998
Springer
15 years 2 months ago
A polyhedral approach to RNA sequence structure alignment
Ribonucleic acid (RNA) is a polymer composed of four bases denoted A, C, G, and U. It is a generally single-stranded molecule where the bases form hydrogen bonds within the same m...
Hans-Peter Lenhof, Knut Reinert, Martin Vingron
INFOCOM
1997
IEEE
15 years 2 months ago
Restoration Strategies and Spare Capacity Requirements in Self-Healing ATM Networks
—This paper studies the capacity and flow assignment problem arising in the design of self-healing asynchronous transfer mode (ATM) networks using the virtual path concept. The ...
Yijun Xiong, Lorne Mason