299 search results - page 46 / 60 » A Convex Relaxation Approach for Computing Minimal Partition... |
TIT
2008
13 years 8 months ago
2008
Abstract--The ranking problem has become increasingly important in modern applications of statistical methods in automated decision making systems. In particular, we consider a for...
FPL
2000
Springer
14 years 17 days ago
2000
Springer
Abstract. In this paper we outline a procedure to determine appropriate partitioning of programmable logic and interconnect area to minimize overall device area across a broad rang...
ACPC
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. A number of techniques are described for solving sparse linear systems on parallel platforms. The general approach used is a domaindecomposition type method in which a pr...
DAC
1989
ACM
14 years 1 months ago
1989
ACM
- New algorithms for high-level synthesis are presented. The first performs scheduling under hardware resource constraints and improves on commonly used list scheduling techniques ...
ICS
2005
Tsinghua U.
14 years 2 months ago
2005
Tsinghua U.
We propose an organization for the on-chip memory system of a chip multiprocessor, in which 16 processors share a 16MB pool of 256 L2 cache banks. The L2 cache is organized as a n...