Sciweavers

162 search results - page 8 / 33
» A knowledge-based analysis of global function computation
Sort
View
ICCV
2011
IEEE
13 years 11 months ago
Localized Principal Component Analysis based Curve Evolution: A Divide and Conquer Approach
We propose a novel localized principal component analysis (PCA) based curve evolution approach which evolves the segmenting curve semi-locally within various target regions (divis...
Vikram Appia, Balaji Ganapathy, Tracy Faber, Antho...
114
Voted
SCIA
2009
Springer
183views Image Analysis» more  SCIA 2009»
15 years 6 months ago
Globally Optimal Least Squares Solutions for Quasiconvex 1D Vision Problems
Abstract. Solutions to non-linear least squares problems play an essential role in structure and motion problems in computer vision. The predominant approach for solving these prob...
Carl Olsson, Martin Byröd, Fredrik Kahl
POPL
2004
ACM
15 years 12 months ago
Global value numbering using random interpretation
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
Sumit Gulwani, George C. Necula
AAAI
2007
15 years 2 months ago
Compact Spectral Bases for Value Function Approximation Using Kronecker Factorization
A new spectral approach to value function approximation has recently been proposed to automatically construct basis functions from samples. Global basis functions called proto-val...
Jeffrey Johns, Sridhar Mahadevan, Chang Wang
104
Voted
CORR
2011
Springer
167views Education» more  CORR 2011»
14 years 6 months ago
Fast global convergence of gradient methods for high-dimensional statistical recovery
Many statistical M-estimators are based on convex optimization problems formed by the weighted sum of a loss function with a norm-based regularizer. We analyze the convergence rat...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...