1604 search results - page 102 / 321 » Approximation algorithms for developable surfaces |
102
click to vote
AAAI
2007
15 years 3 months ago
2007
In normal scenarios, computer scientists often consider the number of states in a game to capture the difficulty of learning an equilibrium. However, players do not see games in ...
117
click to vote
ICML
2003
IEEE
16 years 2 months ago
2003
IEEE
We study the common problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving weighted low-rank approximat...
IJCNN
2006
IEEE
15 years 7 months ago
2006
IEEE
— This paper applies a recently developed neural network called plausible neural network (PNN) to function approximation. Instead of using error correction, PNN estimates the mut...
113
click to vote
CVPR
1998
IEEE
16 years 3 months ago
1998
IEEE
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
128
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently devel...