Sciweavers

6894 search results - page 1098 / 1379
» Generation Problems
Sort
View
PPOPP
1999
ACM
15 years 11 months ago
Automatic Parallelization of Divide and Conquer Algorithms
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
Radu Rugina, Martin C. Rinard
FCCM
1999
IEEE
111views VLSI» more  FCCM 1999»
15 years 11 months ago
Optimizing FPGA-Based Vector Product Designs
This paper presents a method, called multiple constant multiplier trees MCMTs, for producing optimized recon gurable hardware implementations of vector products. An algorithm for ...
Dan Benyamin, John D. Villasenor, Wayne Luk
SIGECOM
1999
ACM
202views ECommerce» more  SIGECOM 1999»
15 years 11 months ago
A methodology for workload characterization of E-commerce sites
Performance analysis and capacity planning for e-commerce sites poses an interesting problem: how to best characterize the workload of these sites. Tradition al workload character...
Daniel A. Menascé, Virgilio Almeida, Rodrig...
SIGGRAPH
1999
ACM
15 years 11 months ago
A Morphable Model for the Synthesis of 3D Faces
In this paper, a new technique for modeling textured 3D faces is introduced. 3D faces can either be generated automatically from one or more photographs, or modeled directly throu...
Volker Blanz, Thomas Vetter
ICCAD
1999
IEEE
101views Hardware» more  ICCAD 1999»
15 years 11 months ago
Efficient model reduction of interconnect via approximate system gramians
Krylov-subspace based methods for generating low-order models of complicated interconnect are extremely effective, but there is no optimality theory for the resulting models. Alte...
Jing-Rebecca Li, Jacob White
« Prev « First page 1098 / 1379 Last » Next »