Sciweavers

1299 search results - page 133 / 260
» Computing Minimal Diagnoses with Critical Set Algorithms
Sort
View
TOG
2012
267views Communications» more  TOG 2012»
13 years 11 days ago
Global parametrization by incremental flattening
Global parametrization of surfaces requires singularities (cones) to keep distortion minimal. We describe a method for finding cone locations and angles and an algorithm for glob...
Ashish Myles, Denis Zorin
SIGMOD
2002
ACM
134views Database» more  SIGMOD 2002»
15 years 10 months ago
Wavelet synopses with error guarantees
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...
Minos N. Garofalakis, Phillip B. Gibbons
EGH
2004
Springer
15 years 3 months ago
Tile-based texture mapping on graphics hardware
Texture mapping has been a fundamental feature for commodity graphics hardware. However, a key challenge for texture mapping is how to store and manage large textures on graphics ...
Li-Yi Wei
IEEESCC
2009
IEEE
14 years 7 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...
DAC
2004
ACM
15 years 11 months ago
Automated design of operational transconductance amplifiers using reversed geometric programming
We present a method for designing operational amplifiers using reversed geometric programming, which is an extension of geometric programming that allows both convex and non-conve...
Johan P. Vanderhaegen, Robert W. Brodersen