Sciweavers

DM
2007
100views more  DM 2007»
13 years 4 months ago
Decompositions of signed-graphic matroids
We give a decomposition theorem for signed graphs whose frame matroids are binary and a decomposition theorem for signed graphs whose frame matroids are quaternary.
Daniel C. Slilaty, Hongxun Qin
JCB
2006
185views more  JCB 2006»
13 years 4 months ago
Identification of Amino Acid Latent Periodicity within 94 Protein Families
Here, we have applied information decomposition, cyclic profile alignment, and noise decomposition techniques to search for latent repeats within protein families of various funct...
Vera P. Turutina, Andrew A. Laskin, Nikolay A. Kud...
JAPLL
2006
109views more  JAPLL 2006»
13 years 4 months ago
Deduction chains for common knowledge
Deduction chains represent a syntactic and in a certain sense constructive method for proving completeness of a formal system. Given a formula , the deduction chains of are built...
Mathis Kretz, Thomas Studer
JCSS
2008
107views more  JCSS 2008»
13 years 4 months ago
A unified theory of structural tractability for constraint satisfaction problems
In this paper we derive a generic form of structural decomposition for the constraint satisfaction problem, which we call a guarded decomposition. We show that many existing decom...
David A. Cohen, Peter Jeavons, Marc Gyssens
IANDC
2006
86views more  IANDC 2006»
13 years 4 months ago
Table design in dynamic programming
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
Peter Steffen, Robert Giegerich
CAD
2006
Springer
13 years 4 months ago
A C-tree decomposition algorithm for 2D and 3D geometric constraint solving
In this paper, we propose a method which can be used to decompose a 2D or 3D constraint problem into a C-tree. With this decomposition, a geometric constraint problem can be reduc...
Xiao-Shan Gao, Qiang Lin, Gui-Fang Zhang
AAI
2006
86views more  AAI 2006»
13 years 4 months ago
Geometric Task Decomposition in a Multi-Agent Environment
Task decomposition in a multi-agent environment is often performed online. This paper proposes a method for subtask allocation that can be performed before the agents are deployed...
Kaivan Kamali, Dan Ventura, Amulya Garga, Soundar ...
DM
2008
97views more  DM 2008»
13 years 4 months ago
(r, r+1)-factorizations of (d, d+1)-graphs
A (d, d + 1)-graph is a graph whose vertices all have degrees in the set {d, d + 1}. Such a graph is semiregular. An (r, r + 1)-factorization of a graph G is a decomposition of G ...
Anthony J. W. Hilton
CVIU
2008
106views more  CVIU 2008»
13 years 4 months ago
Strategies for shape matching using skeletons
Skeletons are often used as a framework for part-based shape description and matching. This paper describes some useful strategies that can be employed to improve the performance ...
Wooi-Boon Goh
CORR
2010
Springer
99views Education» more  CORR 2010»
13 years 4 months ago
On Functional Decomposition of Multivariate Polynomials with Differentiation and Homogenization
In this paper, we give a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which ...
Shang-Wei Zhao, Ruyong Feng, Xiao-Shan Gao