6110 search results - page 470 / 1222 » Approximate Computing |
274
click to vote
TKDE
2012
13 years 10 months ago
2012
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
183
click to vote
ASPDAC
1999
ACM
16 years 1 days ago
1999
ACM
: This paper presents a method for evaluating an upper bound of simultaneous switching gates in combinational circuits. In this method, the original circuit is partitioned into sub...
210
click to vote
JMLR
2006
15 years 7 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
215
click to vote
RTAS
2007
IEEE
16 years 2 months ago
2007
IEEE
Most of today’s real-time embedded systems consist of a heterogeneous mix of fully-programmable processors, fixed-function components or hardware accelerators, and partially-pr...
219
Voted
CAD
2004
Springer
15 years 7 months ago
2004
Springer
This paper presents a method for finding cutting paths on a 3D triangular mesh surface to reduce the stretch in the flattened surface. The cutting paths link the surface boundary ...