Sciweavers

719 search results - page 101 / 144
» Solving Sparse Linear Constraints
Sort
View
ICASSP
2011
IEEE
14 years 2 months ago
Cosparse analysis modeling - uniqueness and algorithms
In the past decade there has been a great interest in a synthesis-based model for signals, based on sparse and redundant representations. Such a model assumes that the signal of i...
Sangnam Nam, Michael E. Davies, Michael Elad, R&ea...
98
Voted
ESSMAC
2003
Springer
15 years 4 months ago
Joint Optimization of Wireless Communication and Networked Control Systems
Abstract. We consider a linear system, such as an estimator or a controller, in which several signals are transmitted over wireless communication channels. With the coding and medi...
Lin Xiao, Mikael Johansson, Haitham A. Hindi, Step...
ICPR
2006
IEEE
16 years 5 days ago
Using Specularities to Recover Multiple Light Sources in the Presence of Texture
Recovering multiple point light sources from a sparse set of photographs in which objects of unknown texture can move is challenging. This is because both diffuse and specular ref...
Pascal Lagger, Pascal Fua
84
Voted
DAC
2008
ACM
16 years 1 days ago
Faster symmetry discovery using sparsity of symmetries
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...
Paul T. Darga, Karem A. Sakallah, Igor L. Markov
PKDD
2009
Springer
88views Data Mining» more  PKDD 2009»
15 years 5 months ago
Feature Weighting Using Margin and Radius Based Error Bound Optimization in SVMs
The Support Vector Machine error bound is a function of the margin and radius. Standard SVM algorithms maximize the margin within a given feature space, therefore the radius is fi...
Huyen Do, Alexandros Kalousis, Melanie Hilario