Sciweavers

34 search results - page 3 / 7
» Lattices of convex normal functions
Sort
View
CORR
2010
Springer
178views Education» more  CORR 2010»
13 years 4 months ago
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
Daniel Dadush, Chris Peikert, Santosh Vempala
JC
2006
115views more  JC 2006»
13 years 5 months ago
Randomly shifted lattice rules on the unit cube for unbounded integrands in high dimensions
We study the problem of multivariate integration on the unit cube for unbounded integrands. Our study is motivated by problems in statistics and mathematical finance, where unboun...
Benjamin J. Waterhouse, Frances Y. Kuo, Ian H. Slo...
PAMI
2008
157views more  PAMI 2008»
13 years 5 months ago
Subpixel Photometric Stereo
Conventional photometric stereo recovers one normal direction per pixel of the input image. This fundamentally limits the scale of recovered geometry to the resolution of the input...
Ping Tan, Stephen Lin, Long Quan
SCALESPACE
2007
Springer
13 years 12 months ago
Fuzzy Region Competition: A Convex Two-Phase Segmentation Framework
This paper introduces a new framework for two-phase image segmentation, namely the Fuzzy Region Competition. A generic formulation is developed that extends in a convex way several...
Benoit Mory, Roberto Ardon
CORR
2012
Springer
220views Education» more  CORR 2012»
12 years 1 months ago
Sparse Topical Coding
We present sparse topical coding (STC), a non-probabilistic formulation of topic models for discovering latent representations of large collections of data. Unlike probabilistic t...
Jun Zhu, Eric P. Xing