692 search results - page 110 / 139 » BDD minimization for approximate computing |
DAC
2006
ACM
15 years 11 months ago
2006
ACM
Deploying multiple supply voltages (multi-Vdds) on one chip is an important technique to reduce dynamic power consumption. In this work we present an optimality study for resource...
STACS
2007
Springer
15 years 4 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
AI
2006
Springer
14 years 10 months ago
2006
Springer
In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which multiple users have distinct preferences. However, making su...
SSDBM
2008
IEEE
15 years 4 months ago
2008
IEEE
Random sampling is a popular technique for providing fast approximate query answers, especially in data warehouse environments. Compared to other types of synopses, random sampling...
SIGGRAPH
2010
ACM
15 years 3 months ago
2010
ACM
The emergence of large-scale freeform shapes in architecture poses big challenges to the fabrication of such structures. A key problem is the approximation of the design surface b...