2168 search results - page 184 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
155
click to vote
SGP
2004
15 years 6 months ago
2004
We propose a metric for surface parameterization specialized to its signal that can be used to create more efficient, high-quality texture maps. Derived from Taylor expansion of s...
133
click to vote
ASPDAC
2004
ACM
15 years 10 months ago
2004
ACM
— We have developed the first real-time 3-D image sensor with VGA pixel resolution using mixed-signal techniques to achieve high-speed and high-accuracy range calculation based ...
143
click to vote
TCAD
2008
15 years 4 months ago
2008
Abstract--Multimedia and DSP applications have several computationally intensive kernels which are often offloaded and accelerated by application-specific hardware. This paper pres...
137
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
164
click to vote
LICS
2010
IEEE
15 years 2 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...