Sciweavers

385 search results - page 17 / 77
» A Fast Algorithm for Matrix Balancing
Sort
View
BMCBI
2006
129views more  BMCBI 2006»
13 years 9 months ago
Fast index based algorithms and software for matching position specific scoring matrices
Background: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs in nucleotide as well as amino acid sequences....
Michael Beckstette, Robert Homann, Robert Giegeric...
ICML
2010
IEEE
13 years 10 months ago
A Fast Augmented Lagrangian Algorithm for Learning Low-Rank Matrices
We propose a general and efficient algorithm for learning low-rank matrices. The proposed algorithm converges super-linearly and can keep the matrix to be learned in a compact fac...
Ryota Tomioka, Taiji Suzuki, Masashi Sugiyama, His...
SIAMSC
2008
142views more  SIAMSC 2008»
13 years 9 months ago
A Fast Direct Solver for the Biharmonic Problem in a Rectangular Grid
We present a fast direct solver methodology for the Dirichlet biharmonic problem in a rectangle. The solver is applicable in the case of the second order Stephenson scheme [34] as ...
Matania Ben-Artzi, Jean-Pierre Croisille, Dalia Fi...
ECCV
2006
Springer
14 years 11 months ago
Balanced Exploration and Exploitation Model Search for Efficient Epipolar Geometry Estimation
Abstract. The estimation of the epipolar geometry is especially difficult where the putative correspondences include a low percentage of inlier correspondences and/or a large subse...
Liran Goshen, Ilan Shimshoni
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 6 months ago
Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
Aleksander Madry