369 search results - page 10 / 74 » Approximation Algorithms for the Bi-criteria Weighted max-cu... |
CIAC
2010
Springer
15 years 4 months ago
2010
Springer
A weighted sequence is a string in which a set of characters may appear at each position with respective probabilities of occurrence. A common task is to locate a given motif in a ...
104
click to vote
DAM
2000
14 years 11 months ago
2000
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to
105
click to vote
ISAAC
1998
Springer
15 years 4 months ago
1998
Springer
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
134
click to vote
STOC
2012
ACM
13 years 2 months ago
2012
ACM
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
ICASSP
2008
IEEE
15 years 6 months ago
2008
IEEE
We propose a new algorithm for Approximate Joint Diagonalization (AJD) with two main advantages over existing state-of-the-art algorithms: Improved overall running speed, especial...