70 search results - page 11 / 14 » Optimal reconstruction might be hard |
POPL
2010
ACM
14 years 7 months ago
2010
ACM
Despite years of work on retargetable compilers, creating a good, reliable back end for an optimizing compiler still entails a lot of hard work. Moreover, a critical component of ...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
KDD
2010
ACM
13 years 7 months ago
2010
ACM
The dynamic marketplace in online advertising calls for ranking systems that are optimized to consistently promote and capitalize better performing ads. The streaming nature of on...
CVPR
2005
IEEE
14 years 11 months ago
2005
IEEE
Images and other high-dimensional data can frequently be characterized by a low dimensional manifold (e.g. one that corresponds to the degrees of freedom of the camera). Recently,...
SIGGRAPH
2000
ACM
14 years 2 months ago
2000
ACM
This paper studies the problem of plenoptic sampling in imagebased rendering (IBR). From a spectral analysis of light field signals and using the sampling theorem, we mathematica...