Sciweavers

3044 search results - page 329 / 609
» Linear logical approximations
Sort
View
CVPR
2010
IEEE
16 years 2 months ago
Convex Shape Decomposition
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
Liu Hairong, Longin Jan Latecki, Liu Wenyu
ICASSP
2009
IEEE
16 years 1 months ago
Compressive sampling of pulse trains: Spread the spectrum!
In this paper we consider the problem of sampling far below the Nyquist rate signals that are sparse linear superpositions of shifts of a known, potentially wide-band, pulse. This...
Farid M. Naini, Rémi Gribonval, Laurent Jac...
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
16 years 1 months ago
Integer Polyhedra for Program Analysis
Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from im...
Philip J. Charles, Jacob M. Howe, Andy King
152
Voted
ICANN
2009
Springer
16 years 1 months ago
Adaptive Feature Transformation for Image Data from Non-stationary Processes
Abstract. This paper introduces the application of the feature transformation approach proposed by Torkkola [1] to the domain of image processing. Thereto, we extended the approach...
Erik Schaffernicht, Volker Stephan, Horst-Michael ...
ACCV
2007
Springer
16 years 28 days ago
Color Constancy Via Convex Kernel Optimization
This paper introduces a novel convex kernel based method for color constancy computation with explicit illuminant parameter estimation. A simple linear render model is adopted and ...
Xiaotong Yuan, Stan Z. Li, Ran He