Sciweavers

152 search results - page 11 / 31
» Minimality in a Linear Calculus with Iteration
Sort
View
ACPC
1999
Springer
13 years 12 months ago
Non-standard Parallel Solution Strategies for Distributed Sparse Linear Systems
Abstract. A number of techniques are described for solving sparse linear systems on parallel platforms. The general approach used is a domaindecomposition type method in which a pr...
Yousef Saad, Masha Sosonkina
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
13 years 11 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
CVPR
2012
IEEE
11 years 10 months ago
Online robust image alignment via iterative convex optimization
In this paper we study the problem of online aligning a newly arrived image to previously well-aligned images. Inspired by recent advances in batch image alignment using low rank ...
Yi Wu, Bin Shen, Haibin Ling
ACML
2009
Springer
14 years 2 months ago
Linear Time Model Selection for Mixture of Heterogeneous Components
Abstract: Our main contribution is to propose a novel model selection methodology, expectation minimization of information criterion (EMIC). EMIC makes a significant impact on the...
Ryohei Fujimaki, Satoshi Morinaga, Michinari Momma...
ML
2002
ACM
167views Machine Learning» more  ML 2002»
13 years 7 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...