Sciweavers

719 search results - page 11 / 144
» Solving Sparse Linear Constraints
Sort
View
CAD
2007
Springer
14 years 10 months ago
Non-iterative approach for global mesh optimization
This paper presents a global optimization operator for arbitrary meshes. The global optimization operator is composed of two main terms, one part is the global Laplacian operator ...
Ligang Liu, Chiew-Lan Tai, Zhongping Ji, Guojin Wa...
79
Voted
ICIP
2006
IEEE
15 years 12 months ago
Tree-Based Orthogonal Matching Pursuit Algorithm for Signal Reconstruction
Recent studies in linear inverse problems have recognized the sparse representation of unknown signal in a certain basis as an useful and effective prior information to solve thos...
Chinh La, Minh N. Do
79
Voted
ESA
2006
Springer
131views Algorithms» more  ESA 2006»
15 years 1 months ago
Finding Total Unimodularity in Optimization Problems Solved by Linear Programs
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
Christoph Dürr, Mathilde Hurand
AMC
2005
87views more  AMC 2005»
14 years 10 months ago
Wavelet based preconditioners for sparse linear systems
A class of efficient preconditioners based on Daubechies family of wavelets for sparse, unsymmetric linear systems that arise in numerical solution of Partial Differential Equatio...
B. V. Rathish Kumar, Mani Mehra
DIS
2010
Springer
14 years 8 months ago
Sparse Substring Pattern Set Discovery Using Linear Programming Boosting
In this paper, we consider finding a small set of substring patterns which classifies the given documents well. We formulate the problem as 1 norm soft margin optimization problem ...
Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Mas...