Sciweavers

6045 search results - page 77 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
ICCV
2011
IEEE
12 years 10 months ago
Fast Template Matching in Non-Linear Tone-Mapped Images
We propose a fast pattern matching scheme termed Matching by Tone Mapping (MTM) which allows matching under non-linear tone mappings. We show that, when tone mapping is approximate...
Yacov Hel-Or, Hagit Hel-Or and Eyal David
RECOMB
2009
Springer
14 years 8 months ago
Searching Protein 3-D Structures in Linear Time
Finding similar structures from 3-D structure databases of proteins is becoming more and more important issue in the post-genomic molecular biology. To compare 3-D structures of tw...
Tetsuo Shibuya
STOC
2012
ACM
242views Algorithms» more  STOC 2012»
11 years 10 months ago
Separating multilinear branching programs and formulas
This work deals with the power of linear algebra in the context of multilinear computation. By linear algebra we mean algebraic branching programs (ABPs) which are known to be com...
Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir ...
CDC
2010
IEEE
130views Control Systems» more  CDC 2010»
13 years 2 months ago
A fast well-conditioned interior point method for predictive control
Interior point methods (IPMs) have proven to be an efficient way of solving quadratic programming problems in predictive control. A linear system of equations needs to be solved in...
Amir Shahzad, Eric C. Kerrigan, George A. Constant...

Book
1455views
15 years 7 months ago
Linear Matrix Inequalities in System and Control Theory
This book shows that several system and control theory problems can be reduced to a few standard convex or quasiconvex optimization problems involving linear matrix inequalities (L...
Stephen Boyd, Laurent El Ghaoui, E. Feron, V. Bala...