874 search results - page 11 / 175 » Faster Algorithms for Semi-Matching Problems |
ICALP
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
Nonnegative Matrix Factorization (NMF) is a dimension reduction method that has been widely used for various tasks including text mining, pattern analysis, clustering, and cancer ...
WABI
2005
Springer
14 years 1 months ago
2005
Springer
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...
IWPEC
2009
Springer
14 years 2 months ago
2009
Springer
In the p-Set Splitting problem we are given a universe U, a family F of subsets of U and a positive integer k and the objective is to find a partition of U into W and B such that...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...