2168 search results - page 78 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
114
Voted
ARITH
2005
IEEE
15 years 10 months ago
2005
IEEE
The pipelined CORDIC with linear approximation to rotation has been proposed to achieve reductions in delay, power and area; however, the schemes for rotation (multiplication) and...
150
click to vote
CVPR
2009
IEEE
17 years 1 days ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
130
Voted
NIPS
2007
15 years 6 months ago
2007
We study the relation between notions of game-theoretic equilibria which are based on stability under a set of deviations, and empirical equilibria which are reached by rational p...
139
click to vote
ICPP
1999
IEEE
15 years 9 months ago
1999
IEEE
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
149
click to vote
CGI
2006
IEEE
15 years 11 months ago
2006
IEEE
Although lots of works have been engaged in interactive and realistic rendering of translucent materials, efficient processing for deformable models remains a challenging problem...