Sciweavers

2254 search results - page 254 / 451
» Computing the minimal covering set
Sort
View
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
15 years 12 months ago
Absolute polynomial factorization in two variables and the knapsack problem
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
Guillaume Chèze
RT
2004
Springer
15 years 12 months ago
Hardware Accelerated Visibility Preprocessing using Adaptive Sampling
We present a novel aggressive visibility preprocessing technique for general 3D scenes. Our technique exploits commodity graphics hardware and is faster than most conservative sol...
Shaun Nirenstein, Edwin H. Blake
SI3D
2003
ACM
15 years 12 months ago
Budget sampling of parametric surface patches
We investigate choosing point samples on a model comprising parametric patches to meet a user specified budget. These samples may then be triangulated, rendered as points or ray-...
Jatin Chhugani, Subodh Kumar
DAC
1996
ACM
15 years 10 months ago
Use of Sensitivities and Generalized Substrate Models in Mixed-Signal IC Design
A novel methodology for circuit design and automatic layout generation is proposed for a class of mixed-signal circuits in presence of layout parasitics and substrate induced nois...
Paolo Miliozzi, Iasson Vassiliou, Edoardo Charbon,...
DPPI
2007
ACM
15 years 10 months ago
From entry to access: how shareability comes about
Abstract. Shareability is a design principle that refers to how a system, interface, or device engages a group of collocated, co-present users in shared interactions around the sam...
Eva Hornecker, Paul Marshall, Yvonne Rogers