Sciweavers

2096 search results - page 103 / 420
» Structured Parameter Elicitation
Sort
View
ESA
2009
Springer
159views Algorithms» more  ESA 2009»
15 years 4 months ago
Contraction Bidimensionality: The Accurate Picture
We provide new combinatorial theorems on the structure of graphs that are contained as contractions in graphs of large treewidth. As a consequence of our combinatorial results we u...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
ICMLA
2008
14 years 11 months ago
Multi-stage Learning of Linear Algebra Algorithms
In evolving applications, there is a need for the dynamic selection of algorithms or algorithm parameters. Such selection is hardly ever governed by exact theory, so intelligent r...
Victor Eijkhout, Erika Fuentes
ICIP
2000
IEEE
15 years 11 months ago
Weighted Factorization
Factorization methods use linear subspace constraints to recover 3D rigid structure from 2D motion. Usually, these methods give equal weight to the contribution of each region (or...
Pedro M. Q. Aguiar, José M. F. Moura
PARCO
2003
14 years 11 months ago
SIMD design to solve partial differential equations
The relation between autonomous and communication phases determines the throughput of parallel structured information processing systems. Such a relation depends on the algorithm w...
R. W. Schulze
DAM
2010
66views more  DAM 2010»
14 years 10 months ago
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework an...
Robert Ganian, Petr Hlinený