Sciweavers

62 search results - page 6 / 13
» Efficient simplex computation for fixture layout design
Sort
View
80
Voted
VC
2008
102views more  VC 2008»
14 years 9 months ago
Solving nonlinear polynomial systems in the barycentric Bernstein basis
We present a method for solving arbitrary systems of N nonlinear polynomials in n variables over an n-dimensional simplicial domain based on polynomial representation in the baryce...
Martin Reuter, Tarjei S. Mikkelsen, Evan C. Sherbr...
DAC
2000
ACM
15 years 10 months ago
Practical iterated fill synthesis for CMP uniformity
We propose practical iterated methods for layout density control for CMP uniformity, based on linear programming, Monte-Carlo and greedy algorithms. We experimentally study the tr...
Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexande...
WWW
2001
ACM
15 years 10 months ago
Efficient Web form entry on PDAs
We propose a design for displaying and manipulating HTML forms on small PDA screens. The form input widgets are not shown until the user is ready to fill them in. At that point, o...
Oliver Kaljuvee, Orkut Buyukkokten, Hector Garcia-...
121
Voted
FCCM
2011
IEEE
241views VLSI» more  FCCM 2011»
14 years 1 months ago
Multilevel Granularity Parallelism Synthesis on FPGAs
— Recent progress in High-Level Synthesis (HLS) es has helped raise the abstraction level of FPGA programming. However implementation and performance evaluation of the HLS-genera...
Alexandros Papakonstantinou, Yun Liang, John A. St...
FPGA
2006
ACM
90views FPGA» more  FPGA 2006»
15 years 1 months ago
Improving performance and robustness of domain-specific CPLDs
Many System-on-a-Chip devices would benefit from the inclusion of reprogrammable logic on the silicon die, as it can add general computing ability, provide run-time reconfigurabil...
Mark Holland, Scott Hauck