1604 search results - page 115 / 321 » Approximation algorithms for developable surfaces |
107
click to vote
ICASSP
2009
IEEE
15 years 8 months ago
2009
IEEE
When sampling signals below the Nyquist rate, efficient and accurate reconstruction is nevertheless possible, whenever the sampling system is well behaved and the signal is well ...
120
Voted
ICIP
2006
IEEE
16 years 3 months ago
2006
IEEE
We present an algorithm for illumination invariant 3D model based tracking and video compression. While model-based coding schemes are well developed, the compression rate reduces...
160
click to vote
SIGGRAPH
2003
ACM
15 years 6 months ago
2003
ACM
This paper introduces a tensor framework for image-based rendering. In particular, we develop an algorithm called TensorTextures that learns a parsimonious model of the bidirectio...
GPEM
2007
15 years 1 months ago
2007
We present a novel means of algorithmically describing a growth process that is an extension of Lindenmayer’s Map L-systems. This growth process relies upon a set of rewrite rule...
101
click to vote
CORR
2010
Springer
15 years 4 days ago
2010
Springer
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...