Related papers: A Efficient Algorithm For Computing k-Factor
Clustering categorical data is an integral part of data mining and has attracted much attention recently. In this paper, we present k-histogram, a new efficient algorithm for clustering categorical data. The k-histogram algorithm extends…
We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the…
An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant…
We present a polynomial-time algorithm that determines, given some choice rule, whether there exists an obviously strategy-proof mechanism for that choice rule.
We have presented a multivariate polynomial function termed as factor elimination function,by which, we can generate prime numbers. This function's mapping behavior can explain the irregularities in the occurrence of prime numbers on the…
In this paper, we prove an analog of Dijkgraaf-Witten's theorem for $g=1$ invariants in quantum K-theory.
The $k$-cut problem asks, given a connected graph $G$ and a positive integer $k$, to find a minimum-weight set of edges whose removal splits $G$ into $k$ connected components. We give the first polynomial-time algorithm with approximation…
A new procedure for simultaneously finding the optimal cluster structure of multivariate functional objects and finding the subspace to represent the cluster structure is presented. The method is based on the $k$-means criterion for…
In the last few years, theoretical study of quantum systems serving as computational devices has achieved tremendous progress. We now have strong theoretical evidence that quantum computers, if built, might be used as a dramatically…
Given a multi-variant polynomial inequality with a parameter, how to find the best possible value of this parameter that satisfies the inequality? For instance, find the greatest number $k$ that satisfies $ a^3+b^3+c^3+…
An algorithm $M$ is described that solves any well-defined problem $p$ as quickly as the fastest algorithm computing a solution to $p$, save for a factor of 5 and low-order additive terms. $M$ optimally distributes resources between the…
Feature selection is a common step in many ranking, classification, or prediction tasks and serves many purposes. By removing redundant or noisy features, the accuracy of ranking or classification can be improved and the computational cost…
We provide a deterministic polynomial-time algorithm that, for a given $k$-uniform hypergraph $H$ with $n$ vertices and edge density $d$, finds a complete $k$-partite subgraph of $H$ with parts of size at least ${c(d, k)(\log…
In this paper, we consider the fault-tolerant $k$-median problem and give the \emph{first} constant factor approximation algorithm for it. In the fault-tolerant generalization of classical $k$-median problem, each client $j$ needs to be…
We develop an algorithm for computing the weight distribution of a linear $[n,k]$ code over a finite field $\mathbb{F}_q$. We represent the codes by their characteristic vector with respect to a given generator matrix and a special type of…
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum…
Different q-factor definitions are considered. The formula connecting different q-factors is given. Also it is pointed the way to find all the q-factors from experimental data.
The problem of decomposing a given covariance matrix as the sum of a positive semi-definite matrix of given rank and a positive semi-definite diagonal matrix, is considered. We present a projection-type algorithm to address this problem.…
We give some theoretical and computational results on "random" harmonic sums with prime numbers, and more generally, for integers with a fixed number of prime factors.
Projective measurements with high quantum efficiency is often assumed to be required for efficient circuit based quantum computing. We argue that this is not the case and show that this fact has actually be known previously though not…