1523 search results - page 70 / 305 » The Computational Complexity of Linear Optics |
COMPGEOM
2010
ACM
14 years 24 days ago
2010
ACM
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
CVPR
2007
IEEE
14 years 11 months ago
2007
IEEE
Belief propagation over pairwise connected Markov Random Fields has become a widely used approach, and has been successfully applied to several important computer vision problems....
CDC
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract— In this paper we demonstrate how one can reformulate the MPC problem for LPV systems to a series of mpLPs by a closed-loop minimax MPC algorithm based on dynamic progra...
TCS
2011
13 years 3 months ago
2011
We give a semantic account of the execution time (i.e. the number of cut elimination steps leading to the normal form) of an untyped MELL net. We first prove that: 1) a net is he...
SDM
2007
SIAM
13 years 10 months ago
2007
SIAM
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...