Sciweavers

488 search results - page 42 / 98
» Automorphic Decompositions of Graphs
Sort
View
SMA
2005
ACM
109views Solid Modeling» more  SMA 2005»
14 years 1 months ago
Numerical decomposition of geometric constraints
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
Sebti Foufou, Dominique Michelucci, Jean-Paul Jurz...
CSB
2005
IEEE
114views Bioinformatics» more  CSB 2005»
14 years 1 months ago
Tree Decomposition Based Fast Search of RNA Structures Including Pseudoknots in Genomes
Searching genomes for RNA secondary structure with computational methods has become an important approach to the annotation of non-coding RNAs. However, due to the lack of effici...
Yinglei Song, Chunmei Liu, Russell L. Malmberg, Fa...
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
14 years 1 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
GBRPR
2009
Springer
14 years 2 months ago
Texture Segmentation by Contractive Decomposition and Planar Grouping
Abstract. Image segmentation has long been an important problem in the computer vision community. In our recent work we have addressed the problem of texture segmentation, where we...
Anders Bjorholm Dahl, Peter Bogunovich, Ali Shokou...
IWOCA
2009
Springer
123views Algorithms» more  IWOCA 2009»
14 years 2 months ago
Computability of Width of Submodular Partition Functions
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...
Petr Skoda