PSIVT
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. A very compact algorithm is presented for fundamental matrix computation from point correspondences over two images. The computation is based on the strict maximum likeli...
PKDD
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. We propose a new graph-based label propagation algorithm for transductive learning. Each example is associated with a vertex in an undirected graph and a weighted edge be...
PKDD
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
MLDM
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. We describe an algorithm called TargetCluster for the discretization of continuous targets in subgroup discovery. The algorithm identifies patterns in the target data an...
IWANN
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. A new algorithm is presented for finding genotype-phenotype association rules from data related to complex diseases. The algorithm was based on Genetic Algorithms, a tech...
ISSAC
2009
Springer
14 years 6 months ago
2009
Springer
We present an efficient algorithm for factoring a multivariate polynomial f ∈ L[x1, . . . , xv] where L is an algebraic function field with k ≥ 0 parameters t1, . . . , tk an...
ISSAC
2009
Springer
14 years 6 months ago
2009
Springer
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
ISSAC
2009
Springer
14 years 6 months ago
2009
Springer
In this paper we give a new algorithm to compute Liouvillian solutions of linear difference equations. Compared to the prior algorithm by Hendriks and Singer, our main contributi...
ISAAC
2009
Springer
14 years 6 months ago
2009
Springer
We provide a certifying algorithm for the problem of deciding whether a P5-free graph is 3-colorable by showing there are exactly six finite graphs that are P5-free and not 3-colo...
ISAAC
2009
Springer
14 years 6 months ago
2009
Springer
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the num...