Sciweavers

1132 search results - page 151 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
ISPD
1998
ACM
88views Hardware» more  ISPD 1998»
15 years 10 months ago
An efficient technique for device and interconnect optimization in deep submicron designs
In this paper, we formulate a new class of optimization problem, named the general CH-posynomial program, and reveal the general dominance property. We propose an efcient algorith...
Jason Cong, Lei He
PODS
1997
ACM
117views Database» more  PODS 1997»
15 years 10 months ago
On the Analysis of Indexing Schemes
We consider the problem of indexing general database workloads (combinations of data sets and sets of potential queries). We de ne a framework for measuring the eciency of an ind...
Joseph M. Hellerstein, Elias Koutsoupias, Christos...
VVS
1996
IEEE
102views Visualization» more  VVS 1996»
15 years 10 months ago
Fast Rendering of Irregular Grids
We propose a fast algorithm for rendering general irregular grids. Our method uses a sweep-plane approach to accelerate ray casting, and can handle disconnected and nonconvex (eve...
Cláudio T. Silva, Joseph S. B. Mitchell, Ar...
ISLPED
1996
ACM
72views Hardware» more  ISLPED 1996»
15 years 10 months ago
Simultaneous buffer and wire sizing for performance and power optimization
In this paper, we study the simultaneous buffer and wire sizing (SBWS) problem for delay and power dissipation minimization. We prove the BS/WS relation for optimal SBWS solutions...
Jason Cong, Cheng-Kok Koh, Kwok-Shing Leung
PODS
1993
ACM
161views Database» more  PODS 1993»
15 years 10 months ago
Blocking for External Graph Searching
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott...